algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 11:34:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Revert "0235二叉搜索树的最近公共祖先"

Browse Source 
This reverts commit c0dbcc8a73eec6517b8b26e376a8c7060b8b858b.
This commit is contained in:
xeniaxie(xl)
2021-06-27 10:35:03 +08:00
parent c0dbcc8a73
commit 1e6265d679
1 changed files with 1 additions and 40 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
problems/0235.二叉搜索树的最近公共祖先.md
View File

@ -312,46 +312,7 @@ func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
}else {return findLeft} }else {return findLeft}
} }
``` ```
JavaScript版本：
1. 使用递归的方法：
```javascript
var lowestCommonAncestor = function(root, p, q) {
// 使用递归的方法
// 1. 使用给定的递归函数lowestCommonAncestor
// 2. 确定递归终止条件
if(root === null) {
return root;
}
if(root.val>p.val&&root.val>q.val) {
// 向左子树查询
let left = lowestCommonAncestor(root.left,p,q);
return left !== null&&left;
}
if(root.val<p.val&&root.val<q.val) {
// 向右子树查询
let right = lowestCommonAncestor(root.right,p,q);
return right !== null&&right;
}
return root;
};
```
2. 使用迭代的方法：
```javascript
var lowestCommonAncestor = function(root, p, q) {
// 使用迭代的方法
while(root) {
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 {
return root;
}
}
return null;
};
```