最近公共祖先

给定一棵二叉树，找到两个节点的最近公共父节点(LCA)。

最近公共祖先是两个节点的公共的祖先节点且具有最大深度。

• 
  

  4
 / \
3   7
   / \
  5   6

LCA(3, 5) = 4

LCA(5, 6) = 7

LCA(6, 7) = 7




解法是：顺着一条p和q都同在一边的链子，也就是说，若P和q都在某节点的左边就去左子树中查找共同的祖先。右边同理。要是p和q不在同一边，那就表示已经

找到第一个共同的祖先。

代码：

#include <iostream>


using namespace std;




//Definition of TreeNode:
class TreeNode {
public:
int val;
TreeNode *left, *right;
TreeNode(int val) {
this->val = val;
this->left = this->right = NULL;
}
};


class Solution {
public:
/**
* @param root: The root of the binary search tree.
* @param A and B: two nodes in a Binary.
* @return: Return the least common ancestor(LCA) of the two nodes.
*/
TreeNode *lowestCommonAncestor(TreeNode *root, TreeNode *A, TreeNode *B) {
// write your code here
if (!covers(root,A) || !covers(root,B))//检查错误
{
return NULL;
}


return commanAncestorHelp(root, A, B);


}


//如果p为root的子孙，那么返回true
bool covers(TreeNode* root, TreeNode* p)
{
if (root == NULL)
{
return false;
}


if (root == p)
{
return true;
}


return covers(root->left, p) || covers(root->right, p);
}


TreeNode* commanAncestorHelp(TreeNode* root, TreeNode* p, TreeNode* q)
{
if (NULL == root)
{
return NULL;
}


if (root == p || root == q)
{
return root;
}


bool is_p_on_left = covers(root->left, p);
bool is_q_on_left = covers(root->left, q);


//如果p,q不在同一边，就返回root
if (is_q_on_left != is_p_on_left)
{
return root;
}


//如果在一边，就访问那一边
TreeNode* child_side = is_p_on_left ? root->left : root->right;
return commanAncestorHelp(child_side, p, q);
}
};