leetcode---Lowest Common Ancestor of a Binary Search Tree
来源:互联网 发布:mac os 开机密码忘记 编辑:程序博客网 时间:2024/06/15 07:32
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. * 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|| p == NULL || q == NULL) return NULL; if(p->val<root->val && q->val<root->val) return lowestCommonAncestor(root->left, p, q); else if(p->val>root->val && q->val>root->val) return lowestCommonAncestor(root->right, p, q); else 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
- 一个屌丝程序猿的人生(七)
- 最小子数组
- 用户管理与权限
- iOS NSString,NSArray,NSDictionary的Copy属性使用
- 以太网基础知识1(UDP协议及分析 )
- leetcode---Lowest Common Ancestor of a Binary Search Tree
- 除主键外 其余内容相同 避免重复插入的办法
- 如何利用BI搭建电商数据分析平台
- kdd cup 99测试集属性含义
- SpringMVC @ResponseBody 415错误处理
- idaq查看arm汇编代码
- iOS开源库源码解析之AsnycDispalyKit
- PAT 1011World Cup Betting (20)
- 微信&java 开发7 js sdk 获取签名 signature