If either n1 or n2 matches with root 's key, report the presence  by returning root (Note that if  a key is ancestor of other,  then the ancestor key becomes LCA
if ( node . data == n1 node . data == n2 ) return node ;