235. Lowest Common Ancestor of a Binary Search Tree
来源:互联网 发布:淘宝客服人工服务 编辑:程序博客网 时间:2024/05/20 18:43
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.
solution:
/** * 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) { int tmp =root->val; if((p->val>tmp&&q->val<tmp)||(p->val<tmp&&q->val>tmp)||p->val==tmp||q->val==tmp) return root; else if(p->val<tmp&&q->val<tmp) return lowestCommonAncestor(root->left,p,q); else return lowestCommonAncestor(root->right,p,q); }};心得:递归
运行速度:快
0 0
- 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
- 235.Lowest Common Ancestor of a Binary Search Tree
- 235. Lowest Common Ancestor of a Binary Search Tree
- 235. Lowest Common Ancestor of a Binary Search Tree
- 235. Lowest Common Ancestor of a Binary Search Tree
- 【LeetCode】235. Lowest Common Ancestor of a Binary Search Tree
- 235. Lowest Common Ancestor of a Binary Search Tree LeetCode
- 235. Lowest Common Ancestor of a Binary Search Tree
- 235. Lowest Common Ancestor of a Binary Search Tree
- 235. Lowest Common Ancestor of a Binary Search Tree
- LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
- 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] 235. Lowest Common Ancestor of a Binary Search Tree
- apche2.4 基于前缀域名的虚拟主机配置
- memcached—使用
- Hadoop可能出现的问题
- Linux内核延时和时间测量函数
- php中 session和cookie的基本使用
- 235. Lowest Common Ancestor of a Binary Search Tree
- 数据管理平台(DMP)
- metaq配置相关之二 : SlaveConfig 和 TopicConfig 类
- PowerDesigner16(PDM)pd生成数据库sql脚本
- 秒转时分秒
- 19-题目1126:打印极值点下标
- iOS-UI控件精讲之【2】-UILabel
- Fragment
- zabbix创建键值、触发器、图形