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

Update 0236.二叉树的最近公共祖先.md

Browse Source
This commit is contained in:
Alvinn
2024-12-09 16:56:47 +08:00
committed by GitHub
parent d2f645803d
commit 451b02dd5d
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -45,7 +45,7 @@
那么二叉树如何可以自底向上查找呢？
回溯啊，二叉树回溯的过程就是从低到上。
回溯啊，二叉树回溯的过程就是从底到上。
后序遍历（左右中）就是天然的回溯过程，可以根据左右子树的返回值，来处理中节点的逻辑。