Solution for http://www.geeksforgeeks.org/lowest-common-ancestor-in-a-binary-search-tree/

LowestCommonAncestor.java

public static Node lca(Node node, int a, int b) {
   while (node != null) {
       if(a > node.value && b > node.value) {
           node = node.right;
       } else if (a < node.value && b < node.value) {
           node = node.left;
       } else {
           return node;
       }
   }
}