Leetcode no. 236
来源:互联网 发布:淘宝分销衣服赚钱吗 编辑:程序博客网 时间:2024/04/28 13:17
236. Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
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).”
_______3______ / \ ___5__ ___1__ / \ / \ 6 _2 0 8 / \ 7 4
For example, the lowest common ancestor (LCA) of nodes 5
and 1
is 3
. Another example is LCA of nodes 5
and 4
is 5
, 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 == null || root == p || root == q) return root; TreeNode left = lowestCommonAncestor(root.left, p, q); TreeNode right = lowestCommonAncestor(root.right, p, q); if(left != null && right != null) return root; return left != null ? left : right; }}
0 0
- Leetcode no. 236
- LeetCode No.11 ~No.12
- Leetcode NO.78 Subsets
- Leetcode NO.77 Combinations
- Leetcode NO.46 Permutations
- 【leetcode】No. 235 LCABST
- LeetCode no. 35
- Leetcode no. 37
- Leetcode no. 279
- Leetcode no. 335
- Leetcode no. 283
- Leetcode no. 181 (sql)
- Leetcode no. 40
- Leetcode no. 238
- Leetcode no. 26
- Leetcode no. 80
- Leetcode no. 228
- Leetcode no. 313
- 分布式ActiveMQ集群
- 常用三维模型文件结构解析
- RxJava zip操作符在Android中的实际使用场景
- 解决VS版本【加载......符号缓慢】的问题
- 常用3D建模工具的材质编辑与纹理贴图方法
- Leetcode no. 236
- Swift - 文本标签(UILabel)的用法
- Nodejs-Koa是一个干净的框架
- 详解SPI中的极性CPOL和相位CPHA
- ActiveMQ介绍和资料集合
- c++ String 转 char*
- 关于算法,那些你不知道的事
- thinkphp3.2【SQL各种查询条件&&select()方法原理追踪】
- 位运算--统计一个数的二进制序列中1的个数