Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * 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==NULL || root==p || root==q)
- {
- return root;
- }
- TreeNode* left = lowestCommonAncestor(root->left,p,q);
- TreeNode* right = lowestCommonAncestor(root->right,p,q);
- if(left==NULL)
- {
- return right;
- }
- else if(right==NULL)
- {
- return left;
- }
- else
- {
- return root;
- }
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement