二叉树的最近公共祖先

二叉树的最近公共祖先

/**
* 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 0;
  }
  if (root == p || root == q)
  {
   return root;
  }
  TreeNode *left = lowestCommonAncestor(root->left, p, q);
  TreeNode *right = lowestCommonAncestor(root->right, p, q);
  if (left&&right)
  {
   return root;
  }
  if (left>right)
  {
   return left;
  }
  else
  {
   return right;
  }
 }
};