Lowest Common Ancestor of a Binary Tree

Lowest Common Ancestor of a Binary Tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”

        _______3______
       /              \
    ___5__          ___1__
   /      \        /      \
   6      _2       0       8
         /  \
         7   4

For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.

解析：

先判断根节点是不是p或者q，若是则返回根节点，若不是则递归判断左子树及右子树的是不是含有p或者q,若p,q分别在左右两棵子树中，则返回根节点，否则返回相应的节点。

代码：

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