二叉树中序遍历

Azureki · Nov 4, 2018 · 2e309ca · 2e309ca
1 parent 251a1f1
commit 2e309ca
Showing 1 changed file with 23 additions and 0 deletions.
diff --git a/lc94. Binary Tree Inorder Traversal.py b/lc94. Binary Tree Inorder Traversal.py
@@ -0,0 +1,23 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+
+class Solution:
+    def inorderTraversal(self, root):
+        """
+        :type root: TreeNode
+        :rtype: List[int]
+        """
+        def dfs(root):
+            if not root:
+                return
+            dfs(root.left)
+            res.append(root.val)
+            dfs(root.right)
+        res = []
+        dfs(root)
+        return res