Leetcode | Lowest Common Ancestor of a Binary Search Tree
来源:互联网 发布:iota 网络被攻击 编辑:程序博客网 时间:2024/06/05 16:34
question
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.
explaination
节点p、q和根节点的关系有三种情况
(1)p、q在根节点的左结点
(2)p、q在根节点的右结点
(3)p、q分别在根节点的左右结点
由于是二叉查找树,所以在左结点比根结点小 右结点比根结点大,可以根据这个性质进行判断
solution
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { while((root.val-p.val)*(root.val-q.val) > 0) { root= root.val>p.val?root.left : root.right; } return root;}
0 0
- leetcode 235: Lowest Common Ancestor of a Binary Search Tree
- LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
- leetcode: Lowest Common Ancestor of a Binary Search Tree
- [leetcode][dfs] Lowest Common Ancestor of a Binary Search Tree
- [leetcode] 235.Lowest Common Ancestor of a Binary Search Tree
- 【LeetCode】235 Lowest Common Ancestor of a Binary Search Tree
- [LeetCode]235.Lowest Common Ancestor of a Binary Search Tree
- leetcode 235 Lowest Common Ancestor of a Binary Search Tree
- [leetcode] Lowest Common Ancestor of a Binary Search Tree
- LeetCode Lowest Common Ancestor of a Binary Search Tree
- leetCode(38):Lowest Common Ancestor of a Binary Search Tree
- leetcode-235-Lowest Common Ancestor of a Binary Search Tree
- [LeetCode]Lowest Common Ancestor of a Binary Search Tree
- Leetcode: Lowest Common Ancestor of a Binary Search Tree
- leetcode[235]:Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Search Tree-leetcode
- 【leetcode】Lowest Common Ancestor of a Binary Search Tree
- 【Leetcode】Lowest Common Ancestor of a Binary Search Tree
- Android LayoutInflater使用解析
- java 8新特性lambda表达式优劣浅谈
- 以日期方式判断闰年
- 如何用arrayList不重复的存储实体类
- java android 时间类 DateTime extends java.util.GregorianCalendar
- Leetcode | Lowest Common Ancestor of a Binary Search Tree
- Implement strStr()
- 计算21世纪的闰年个数
- SAP Storage Location 从不参与MRP运算改成参与MRP运算的影响
- 32位汇编第三讲----【RedASM与代码注入】(2016-12-16)
- UINavigationBar,UITabBar背景图
- nat 协议
- Composer在ubuntu中的安装
- java枚举