235. Lowest Common Ancestor of a Binary Search Tree


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

 


注意!

本站转载的文章为个人学习借鉴使用,本站对版权不负任何法律责任。如果侵犯了您的隐私权益,请联系我们删除。



 
粤ICP备14056181号  © 2014-2021 ITdaan.com