二叉树中两个结点的最近公共祖先

阅读更多

 

 

Node* findComAncestor(Node* root, Node* m, Node* n) {
        if (root == m || root == n || root == NULL) {
                return root;
        }
       
        Node* left = findComAncestor(root->left,m,n);
        Node* right = findComAncestor(root->right, m,n);
        if (left && right) {  //m和n分属于root和right的左右子树
               return root;
        }
        return left? left : right;

}