public TreeNode LCA(TreeNode root, TreeNode u, TreeNode v) {

	TreeNode small = null, big = null;
	if (u.val < v.val) {
		small = u;
		big = v;
	}
	
	else {
		small = v;
		big = u;
	}
	
	
	while(root != null) {
		if (root.val < small)
			root = root.right;
		
		else if (root.val > big)
			root = root.left;
			
		else
			return root;
	}
	
	return null;
	
	

}

if (root == null)
	return null;
	
if (root == u || root == v)
	return root;
	
TreeNode left = getLCA(root.left, u, v);
TreeNode right = getLCA(root,right, u, v);

if (left != null && right != null)
	return root;

else if (left != null)
	return left;
	
else if (right != null)
	return right;

else 
	return null; }