public static MyTreeNode<Integer> LowestCA(MyTreeNode<Integer> root, MyTreeNode<Integer> node1, MyTreeNode<Integer> node2) {
		if (root == null) {
			return null;
		}
		if (root.getData() == node1.getData() || root.getData() == node2.getData()) {
			return root;
		}
		MyTreeNode<Integer> left = LowestCA(root.getLeft(), node1, node2);
		MyTreeNode<Integer> right = LowestCA(root.getRight(), node1, node2);
		if(left != null && right != null){
			return root;
		}
		if(left == null){
			return right;
		}
		return left;
	}