We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Binary Search Tree : Lowest Common Ancestor
  2. Discussions

Binary Search Tree : Lowest Common Ancestor

  • vadym_usatiuk
     + 0 comments

    Java 7 O(n)

    public static Node lca(Node root, int v1, int v2) {
            while (root != null) {
                if (root.data > v1 && root.data > v2) {
                    root = root.left;
                } else if (root.data < v1 && root.data < v2) {
                    root = root.right;
                } else {
                    return root;
                }
            }
            return null;
        }