Leetcode 235. Lowest Common Ancestor of a Binary Search Tree
题目链接：https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/
方法一 迭代
1 方法思想
2 代码实现
/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val = x; }* }*/class Solution {public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {while (true) {if (root.val > p.val && root.val > q.val) {root = root.left;} else if (root.val < p.val && root.val < q.val) {root = root.right;} else {break;}}return root;}
}
3 复杂度分析
时间复杂度：
空间复杂度：
4 涉及到知识点
5 总结
方法二 递归
1 方法思想
2 代码实现
/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val = x; }* }*/class Solution {public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {if (root.val > p.val && root.val > q.val) return lowestCommonAncestor(root.left, p, q);if (root.val < p.val && root.val < q.val) return lowestCommonAncestor(root.right, p, q);return root;}
}
3 复杂度分析
时间复杂度：
空间复杂度：
4 涉及到知识点
5 总结
Leetcode 235. Lowest Common Ancestor of a Binary Search Tree相关推荐
- [LeetCode]235.Lowest Common Ancestor of a Binary Search Tree
题目 Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the ...
- leetcode 235. Lowest Common Ancestor of a Binary Search Tree | 235. 二叉搜索树的最近公共祖先（哈希表）
题目 https://leetcode.com/problems/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 因为是binary search tree,因此利用没个节点的值进行二分查找即可复杂度O(h ...
- 235. Lowest Common Ancestor of a Binary Search Tree(Tree-Easy)
转载请注明作者和出处: http://blog.csdn.net/c406495762 Given a binary search tree (BST), find the lowest common ...
- Leet Code OJ 235. Lowest Common Ancestor of a Binary Search Tree [Difficulty: Easy]
题目: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in th ...
- Lowest Common Ancestor of a Binary Search Tree a Binary Tree
235. Lowest Common Ancestor of a Binary Search Tree 题目链接:https://leetcode.com/problems/lowest-common ...
- [CareerCup] 4.7 Lowest Common Ancestor of a Binary Search Tree 二叉树的最小共同父节点
4.7 Design an algorithm and write code to find the first common ancestor of two nodes in a binary tr ...
- Lowest Common Ancestor of a Binary Search Tree(树中两个结点的最低公共祖先)
题目描述: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in ...
- Leetcode题目：Lowest Common Ancestor of a Binary Search Tree
题目:Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the ...
- LeetCode：235. 二叉搜索树的最近公共祖先(Lowest Common Ancestor of a Binary Search Tree)
二叉搜索树性质: 1.任意节点node,其左子树中的val不大于node.val,其右子树中的val不小于node.val. 2.不同的二叉搜索树可以代表同一组值的集合 3.二叉搜索树的基本操作和树的 ...
最新文章
- 下载r包IlluminaHumanMethylation450kanno.ilmn12.hg19
- 《高新技术企业知识产权管理》阅读笔记
- JavaParser中AST节点的观察者
- python 程序打包 vscode_使用VScode编写python程序并打包成.exe文件
- c语言argc,C语言 argc和argv
- 浏览器插件之ActiveX开发（三）
- Javascript实现子窗口向父窗口传值(转)
- C#中的线程（三）多线程
- POI--各种样式的XSSFCellStyle的生成
- 用java开发pc软件
- 基于SpringBoot的社团管理系统的设计与实现
- uva 11137 Ingenuous Cubrency
- 计算机类课题研究方法,课题研究方法有哪些
- 学计算机专业的人,哪些人适合学习计算机专业？
- 【自学Python：Day3】放假的心该怎么冷静下来学……
- STM32 之 HAL库
- SpringCloud微服务网关技术——Gateway网关的使用
- python读取csv文件表头_python读csv文件时指定行为表头或无表头的方法
- Chart.xkcd图表库
- MapReduce 的基本原理