Will this code work to find the rightmost leaf recursively. Thank you
 Node* findRightMostLeaf(Node* curNode){
 if (curNode== NULL) 
     return null;
 if (curNode->rchild!= NULL)
   return findRightMostLeaf(curNode->rchild);
 if (curNode->lchild!= NULL)
   return findRightMostLeaf(curNode->lchild);
else return curNode; } 
 
    