/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(!root)
return NULL;
TreeNode* left=lowestCommonAncestor(root->left,p,q);
TreeNode* right=lowestCommonAncestor(root->right,p,q);
if(left&&right||root==p||root==q)
return root;
if(left)
return left;
if(right)
return right;
return NULL;
}
};
leetcode 236: Lowest Common Ancestor of a Binary Tree
最新推荐文章于 2022-10-10 12:58:14 发布