From 80550ff36fdcbfe7ff0fcda40063faf8881f09d7 Mon Sep 17 00:00:00 2001
From: Logen <47022821+Logenleedev@users.noreply.github.com>
Date: Mon, 26 Dec 2022 22:18:32 -0600
Subject: [PATCH] fix minor typo

---
 codes/python/chapter_tree/binary_tree_dfs.py | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/codes/python/chapter_tree/binary_tree_dfs.py b/codes/python/chapter_tree/binary_tree_dfs.py
index 425d8c771..f69076a6c 100644
--- a/codes/python/chapter_tree/binary_tree_dfs.py
+++ b/codes/python/chapter_tree/binary_tree_dfs.py
@@ -8,17 +8,17 @@ import sys, os.path as osp
 sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
 from include import *
 
-# 定义一个result数组用来存储遍历的结果
-result = []
+# 定义一个list数组用来存储遍历的结果
+
 
 # 前序遍历
 def preorder(root):
     if root == None:
         return []
-    ·
+    
     # 访问顺序：根结点 -> 左子树 -> 右子树
 
-    result.append(root.val)
+    list.append(root.val)
     preorder(root.left)
     preorder(root.right)
 
@@ -31,7 +31,7 @@ def inorder(root):
     # 访问顺序：左子树 -> 根结点 -> 右子树
     
     inorder(root.left)
-    result.append(root.val)
+    list.append(root.val)
     inorder(root.right)
 
 # 后序遍历
@@ -43,4 +43,4 @@ def postorder(root):
 
     postorder(root.left)
     postorder(root.right)
-    result.append(root.val)
+    list.append(root.val)