Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit b0edeca

Browse files
Merge pull request #167 from charon2121/master
添加 94 144 145 python3版本
2 parents c4bfb1f + 13e7e63 commit b0edeca

File tree

1 file changed

+47
-1
lines changed

1 file changed

+47
-1
lines changed

‎problems/二叉树的递归遍历.md‎

Lines changed: 47 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -170,7 +170,53 @@ class Solution {
170170
```
171171

172172
Python:
173-
173+
```python3
174+
# 前序遍历-递归-LC144_二叉树的前序遍历
175+
class Solution:
176+
def preorderTraversal(self, root: TreeNode) -> List[int]:
177+
# 保存结果
178+
result = []
179+
180+
def traversal(root: TreeNode):
181+
if root == None:
182+
return
183+
result.append(root.val) # 前序
184+
traversal(root.left) #
185+
traversal(root.right) #
186+
187+
traversal(root)
188+
return result
189+
190+
# 中序遍历-递归-LC94_二叉树的中序遍历
191+
class Solution:
192+
def inorderTraversal(self, root: TreeNode) -> List[int]:
193+
result = []
194+
195+
def traversal(root: TreeNode):
196+
if root == None:
197+
return
198+
traversal(root.left) #
199+
result.append(root.val) # 中序
200+
traversal(root.right) #
201+
202+
traversal(root)
203+
return result
204+
205+
# 后序遍历-递归-LC145_二叉树的后序遍历
206+
class Solution:
207+
def postorderTraversal(self, root: TreeNode) -> List[int]:
208+
result = []
209+
210+
def traversal(root: TreeNode):
211+
if root == None:
212+
return
213+
traversal(root.left) #
214+
traversal(root.right) #
215+
result.append(root.val) # 后序
216+
217+
traversal(root)
218+
return result
219+
```
174220

175221
Go:
176222

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /