Thread: Binary Tree/Recursion

Very clever Perspective =)

How's this look?

Code:

BTREE findRightMostLeaf(BTREE root)
{
        if (root != NULL)
        {
                if((root -> left == NULL) && (root -> right)) //node is a leaf
                        return root;
                else if((root -> left != NULL) && 
                           (root -> right))           &&
                           (root -> left -> right != NULL))
                        return findRightMostLeaf(root -> left -> right);

                else
                        return findRightMostLeaf(root -> right);
        }

}