Find least common ancestor for 2 nodes a, b in a binary tree ( not BST )

LCABinaryTree.java

public Node getLCA( Node node, int a, int b ){
  if( node == null ){
    return node;
  }
  
  if( node.getData() == a || node.getData() == b ){
    return node;
  }
  
  Node lcaInLeft  = getLCA( node.getLeft(), a, b );
  Node lcaInRight = getLCA( node.getRight(), a, b );
  
  if( lcaInLeft != null && lcaInRight != null ){
    return node;
  }
  if( lcaInLeft == null &&  lcaInRight != null){
    return  lcaInRight;
  }
  if( lcaInLeft != null &&  lcaInRight == null){
    return lcaInLeft;
  }
  if( lcaInLeft == null &&  lcaInRight == null){
    return null;  
  }
}