算法作业HW30:LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
来源:互联网 发布:福利软件下载 编辑:程序博客网 时间:2024/05/20 23:32
Description:
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
Note:
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 nodes2
and 4
is 2
, since a node can be a descendant of itself according to the LCA definition.
Solution:
Analysis and Thinking:
题目要求对于给定的一个二叉搜索树,找出给出的两个结点的最近公共祖先,可以使用递归的思想实现
Steps:
1. 如果当前两待搜索结点都小于根结点,进行右子树递归
2. 如果当前两待搜索结点都大于根结点,进行左子树递归
3. 如果两节点大小不等(一个大于根结点,一个小于),返回根结点
Codes:
class Solution {public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if (p->val > root->val && q->val > root->val) return lowestCommonAncestor(root->right, p, q); if (p->val < root->val && q->val < root->val) return lowestCommonAncestor(root->left, p, q); return root; }};
Results:
阅读全文
0 0
- 算法作业HW30: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】235. Lowest Common Ancestor of a Binary Search Tree
- 235. Lowest Common Ancestor of a Binary Search Tree LeetCode
- 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] 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
- LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
- leetcode-235. Lowest Common Ancestor of a Binary Search Tree
- 235.[Leetcode]Lowest Common Ancestor of a Binary Search Tree
- ArcGIS水文分析实战教程(9)雨量计算与流量统计
- 初试swift语言ios开发
- html的基础知识(章节一)
- Reverse String I、II、III(tag:String)
- Chapter1 面试流程
- 算法作业HW30:LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
- roaringbitmap 源码解析 bitmap add过程
- C++常见程序计时方法
- 2017-07-06:大神
- 3.验证框架
- client到openflow协议栈
- LeetCode 69. Sqrt(x)
- 基本概念、标签、跳转
- 分组