[Java]LeetCode235 Lowest Common Ancestor of a Binary Search Tree

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.

题意,给出两个节点,让你判断两个节点的父节点,两个节点中也有可能有父节点。而且这题的树是二叉排序树,也就是,左节点比根节点要小,右节点比根节点要大。
解题思路:1)首先判断两个节点中是否有根节点,如果有,返回根节点。2)如果没有,比较root.val>Math.max(p.val,q.val),是,则表示两个节点在左子树上。3)如果否,比较root.val<Math.min(p.val,q.val),是,则表示两个节点再右子树上。4)剩下的情况就是分别在左右子树上。
 public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root==p||root==q)return root;
        if(root.val>Math.max(p.val,q.val))
        {
            root=lowestCommonAncestor(root.left,p,q);
        }else if(root.val<Math.min(p.val,q.val))
        {
            root=lowestCommonAncestor(root.right,p,q);
        }
        return root;     
    }



阅读更多
文章标签: java leetcode
个人分类: 算法
所属专栏: LeetCode Java解题集合
上一篇笔试:天猫魔盒下单问题
下一篇[Java]Leetcode236 Lowest Common Ancestor of a Binary Tree
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭