[leetcode-236]Lowest Common Ancestor of a Binary Tree(C语言)236

问题描述：
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.

这道题没理解透，不好乱说话，请参考：这篇博客
代码如下：16ms

struct TreeNode* lowestCommonAncestor(struct TreeNode* root, struct TreeNode* p, struct TreeNode* q) {
    if(root==NULL)
        return NULL;
    if(root==p||root==q)
        return root;
    struct TreeNode *left = lowestCommonAncestor(root->left,p,q);
    struct TreeNode *right = lowestCommonAncestor(root->right,p,q);
    if(left&&right){//p or q on both side of root
        return root;
    }
    return left?left:right;
}