Lowest Common Ancestor of a Binary Search Tree
来源:互联网 发布:java程序员进阶之路 编辑:程序博客网 时间:2024/06/06 05:38
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.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root.val>Math.max(p.val,q.val)){
return lowestCommonAncestor(root.left,p,q);
}
else if(root.val<Math.min(p.val,q.val)){
return lowestCommonAncestor(root.right,p,q);
}else{
return root;
}
}
}
- 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 (235)
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Search Tree leetcode235
- LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Search Tree
- 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
- Lowest Common Ancestor of a Binary Search Tree
- 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
- codeforces95C 最短路套最短路
- 小量压缩简单算法
- Linux 字体缺失解决方案
- 关于 Delphi 中流的使用(7) 压缩与解压缩(TCompressionStream、TDecompressionStream)
- 01-Hive创建表
- Lowest Common Ancestor of a Binary Search Tree
- 堆和栈的区别
- thinkphp如何去掉index.php
- JMS详细说明与应用(ACTIVEMQ)
- 使用QueueUserWorkerItem实现的线程池封装
- 图像处理在仪表自动化中的应用
- .Net Json序列化日期/Date(xxxx)/的Js转化&C#转化
- 组件签名
- 正益工作是何许APP?凭什么作为第一届大会的“闪亮”点