Lowest Common Ancestor of a Binary Tree
来源:互联网 发布:陕西大数据集团前景 编辑:程序博客网 时间:2024/05/16 19:19
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. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if (root == NULL) return NULL; if (root == p || root == q) return root; TreeNode *L = lowestCommonAncestor(root->left, p, q); TreeNode *R = lowestCommonAncestor(root->right, p, q); if (L && R) return root; return L ? L : R; }};
0 0
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree(***)
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- 划分树的学习(求区间第k大的数字)&&分块求区间第k大
- POJ 1679 The Unique MST(判断最小生成树_Kruskal)
- java web前端学习网站
- Elasticsearch 索引优化
- MDK如何生成bin文件?
- Lowest Common Ancestor of a Binary Tree
- Spring学习笔记(七):IOC控制反转
- CentOS 7安装Nginx
- 【对象序列化】pickle.dumps()--python对象序列化/反序列化
- POJ 3225 Help with Intervals (线段树 成段更新, 懒惰标记*2)
- leetcode:Binary Tree Paths
- 动态链接库
- Linux中brk()系统调用,sbrk(),mmap(),malloc(),calloc()的异同
- 借口也是类。也要声明一个对象来调用