Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

更新 二叉树的递归遍历 python三个代码没有调用递归函数dfs(root) #2530

Closed
wants to merge 1 commit into from
Closed

更新 二叉树的递归遍历 python三个代码没有调用递归函数dfs(root) #2530

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
12 changes: 6 additions & 6 deletions problems/二叉树的递归遍历.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -189,8 +189,8 @@ class Solution:
res.append(node.val)
dfs(node.left)
dfs(node.right)

return res
dfs(root) 
return res 

```
```python
Expand All @@ -205,16 +205,16 @@ class Solution:

dfs(node.left)
res.append(node.val)
dfs(node.right)

dfs(node.right) 
dfs(root)
return res
```
```python


# 后序遍历-递归-LC145_二叉树的后序遍历
class Solution:
def postorderTraversal(self, root: TreeNode) -> List[int]:
def postorderTraversal(self, root: TreeNode) -> List[int]: 
res = []

def dfs(node):
Expand All @@ -224,7 +224,7 @@ class Solution:
dfs(node.left)
dfs(node.right)
res.append(node.val)

dfs(root)
return res
```

Expand Down