CareerCup

class Node:
    def __init__(self, data, left=None, right=None):
        self.data = data
        self.left = left
        self.right = right

def find_next_largest_in_bst(root, k):
    current = root
    # Will return None if no possible number can be found in BST
    top_prospect = None
    while current:
        if current.data > k:
            top_prospect = current.data
            current = current.left
        else:
            current = current.right
    return top_prospect

def find_next_largest_in_bst(root, k):
current = root
# Will return None if no possible numbers are found in BST
top_prospect = None
while current:
if current.data > k:
top_prospect = current.data
current = current.left
else:
current = current.right
return top_prospect

suppose node structure is like

struct node
{
	int data;
	struct node *left;
	struct node *right;
}
int finMax(struct node *root,int k)
{
	if(!root)
		return -1; if there is no node greater than k
	return finMax(root->left,k);
	if(root->data > k)
		return root->data;
	return finMax(root->right,k)
}

static class TreeNode {
		TreeNode left;
		TreeNode right;
		int data;
	}
	public static int smallestGreaterInteger(TreeNode root, int k) {
		int smallestGreaterInteger = -1;
		while (root != null) {
			if (root.data > k) {
				smallestGreaterInteger = root.data;
				root = root.left;
			} else {
				root = root.right;
			}
		}
		return smallestGreaterInteger;

}

//C# Solution

namespace Pratise
{
static class Program
{
static void Main(string[] args)
{
int[] s = {10,20,50,60,22,70,30,80,40};
int t = 20;
int[] n = new int[s.Count()];
for(int k =0; k < s.Count(); k++){
if (s[k] > t )
{
n[k] = s[k];
}
Array.Sort(n);
}
for (int i = 0; i < n.Count(); i++ )
{
if (n[i] == 0)
{
}else
{
Console.WriteLine(n[i]);
break;
}
}
}
}
}