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

add dfs function operation in the main traversal function

Browse Source
This commit is contained in:
Xiong Gu
2024-04-04 14:57:42 -04:00
parent 3dd5b33cec
commit 616258da20
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/二叉树的递归遍历.md
View File

@ -189,7 +189,7 @@ class Solution:
res.append(node.val) res.append(node.val)
dfs(node.left) dfs(node.left)
dfs(node.right) dfs(node.right)
dfs(root)
return res return res
``` ```
@ -207,6 +207,7 @@ class Solution:
res.append(node.val) res.append(node.val)
dfs(node.right) dfs(node.right)
dfs(root)
return res return res
``` ```
```python ```python
@ -224,7 +225,7 @@ class Solution:
dfs(node.left) dfs(node.left)
dfs(node.right) dfs(node.right)
res.append(node.val) res.append(node.val)
dfs(root)
return res return res
``` ```