题解 | #在二叉树中找到两个节点的最近公共祖先#

//c++ 递归方法
/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param root TreeNode类 
     * @param o1 int整型 
     * @param o2 int整型 
     * @return int整型
     */


    int lowestCommonAncestor(TreeNode* root, int o1, int o2) {
        // write code here
        if (root==NULL) {
            return -1;
        }
        if (o1==root->val||o2==root->val) {
            return root->val;
        }
        int left=lowestCommonAncestor(root->left, o1, o2);
        int right=lowestCommonAncestor(root->right, o1, o2);
        if (left==-1) {
            return right;
        
        }
        else if (right==-1) {
            return left;
        }
        else return root->val;


    }
};