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

0235.二叉搜索树的最近公共祖先一处错别字

Browse Source
This commit is contained in:
ForsakenDelusion
2024-12-21 18:06:53 +08:00
committed by GitHub
parent 21a3215a78
commit e93f00aef7
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -99,7 +99,7 @@ if (cur == NULL) return cur;
* 确定单层递归的逻辑
在遍历二叉搜索树的时候就是寻找区间[p->val, q->val]（注意这里是左闭又闭）
在遍历二叉搜索树的时候就是寻找区间[p->val, q->val]（注意这里是左闭右闭）
那么如果 cur->val 大于 p->val，同时 cur->val 大于q->val，那么就应该向左遍历（说明目标区间在左子树上）。