LeetCode OJ 之 Lowest Common Ancestor of a Binary Search 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.

思路：

1、递归

2、迭代

参考：http://blog.csdn.net/u012243115/article/details/45367963。

代码1：

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

代码2：

/**
 * 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 || q == NULL || p == NULL)
            return NULL;
        int Max = max(p->val , q->val);
        int Min = min(p->val , q->val);
        while(root)
        {
            if(root->val >= Min && root->val <= Max)
                return root;
            if(root->val > Max)
                root = root->left;
            else
                root = root->right;
        }
        return NULL;
    }
};