LeetCode || Lowest Common Ancestor of a Binary Search Tree-CSDN博客

本文链接：https://blog.csdn.net/xsloop/article/details/48222503

Lowest Common Ancestor of a Binary Search Tree

Total Accepted: 21201 Total Submissions: 56036 My Submissions

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

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).”

        _______6______
       /              \
    ___2__          ___8__
   /      \        /      \
   0      _4       7       9
         /  \
         3   5

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

比较简单，直接根据平衡二叉树的取值判断。

/**
 * 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:
    bool Less(int x, int y)
    {
        return (x < y);
    }
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL)
            return NULL;
        if(p == NULL)
            return q;
        if(q == NULL)
            return p;
        
        TreeNode* t = root;
        while(t!=NULL)
        {
            if(p->val == t->val)
                break;
            if(q->val == t->val)
                break;
                
            bool tp = Less(p->val, t->val);
            bool tq = Less(q->val, t->val);
            
            if(tp ^ tq)//异或，说明结果位于树的两侧
                break;
            
            if(tp && tq)//均为左节点
                t = t->left;
            if(!tp && !tq)//均为右节点
                t = t->right;
        }
        return t;
    }
};