From b4f55e72745f4f6fbf27dd4bdb2201f1b430b9f2 Mon Sep 17 00:00:00 2001
From: zhangchang <zhangchang@stu.cqie.edu.cn>
Date: 2024年2月24日 22:46:14 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BC=98=E5=8C=96Python=E9=80=92=E5=BD=92?=
 =?UTF-8?q?=E6=97=B6=E6=89=80=E9=9C=80=E8=A6=81=E7=9A=84=E5=86=85=E5=AD=98?=
 =?UTF-8?q?=E5=BC=80=E9=94=80=E5=92=8C=E6=97=B6=E9=97=B4=E6=B6=88=E8=80=97?=
 =?UTF-8?q?=E3=80=82?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
---
 ...22345円275円222円351円201円215円345円216円206円.md" &#124; 54 +++++++++++--------
 1 file changed, 33 insertions(+), 21 deletions(-)
diff --git "a/problems/344円272円214円345円217円211円346円240円221円347円232円204円351円200円222円345円275円222円351円201円215円345円216円206円.md" "b/problems/344円272円214円345円217円211円346円240円221円347円232円204円351円200円222円345円275円222円351円201円215円345円216円206円.md"
index edd55aad3c..4621d4a739 100644
--- "a/problems/344円272円214円345円217円211円346円240円221円347円232円204円351円200円222円345円275円222円351円201円215円345円216円206円.md"
+++ "b/problems/344円272円214円345円217円211円346円240円221円347円232円204円351円200円222円345円275円222円351円201円215円345円216円206円.md"
@@ -180,26 +180,34 @@ class Solution {
 
 class Solution:
 def preorderTraversal(self, root: TreeNode) -> List[int]:
- if not root:
- return []
-
- left = self.preorderTraversal(root.left)
- right = self.preorderTraversal(root.right)
-
- return [root.val] + left + right
+ res = []
+ 
+ def dfs(node):
+ if node is None:
+ return
+ 
+ res.append(node.val)
+ dfs(node.left)
+ dfs(node.right)
+ 
+ return res
 
 ```
 ```python
 # 中序遍历-递归-LC94_二叉树的中序遍历
 class Solution:
 def inorderTraversal(self, root: TreeNode) -> List[int]:
- if root is None:
- return []
-
- left = self.inorderTraversal(root.left)
- right = self.inorderTraversal(root.right)
-
- return left + [root.val] + right
+ res = []
+ 
+ def dfs(node):
+ if node is None:
+ return
+ 
+ dfs(node.left)
+ res.append(node.val)
+ dfs(node.right)
+ 
+ return res
 ```
 ```python
 
@@ -207,13 +215,17 @@ class Solution:
 # 后序遍历-递归-LC145_二叉树的后序遍历
 class Solution:
 def postorderTraversal(self, root: TreeNode) -> List[int]:
- if not root:
- return []
-
- left = self.postorderTraversal(root.left)
- right = self.postorderTraversal(root.right)
-
- return left + right + [root.val]
+ res = []
+ 
+ def dfs(node):
+ if node is None:
+ return
+ 
+ dfs(node.left)
+ dfs(node.right)
+ res.append(node.val)
+ 
+ return res
 ```
 
 ### Go:
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/youngyangyang04-leetcode-master/pull/424.patch">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/youngyangyang04-leetcode-master/pull/424.patch" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>