Leetcode64: Lowest Common Ancestor of a Binary Search Tree
来源:互联网 发布:协同过滤推荐算法综述 编辑:程序博客网 时间:2024/06/08 15: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. * 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 || !p || !q) return NULL; if(max(p->val, q->val) < root->val) return lowestCommonAncestor(root->left, p, q); else if(min(p->val, q->val) > root->val) return lowestCommonAncestor(root->right, p, q); else return root; } };
0 0
- Leetcode64: 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
- 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
- Leetcode63: Binary Tree Paths
- mysql链接大量出错
- JQ自带的AjaxForm提交
- C#连接4种类型数据库(Access、SQL Server、Oracle、MySQL)
- iOS 9 iOS9 HTTP 不能正常使用的解决办法
- Leetcode64: Lowest Common Ancestor of a Binary Search Tree
- IEnumerable及IEnumerator接口
- ORACLE常用SQL语句大全
- Javascript学习笔记【第三章】3
- java 学习系列 自我认识
- 优化Extract抽取进程性能,解决OGG抽取日志延迟
- 线性素数筛法模板
- 升级xcode7之后,真机调试出现BaiduMapAPI.framework/BaiduMapAPI(BMAddrList.o)' does not contain bitcode的问题
- jquery 中的hover(),mouseleave()&mouseenter()和mouseover()&mouseout()的区别