Time: 0 ms (100%), Space: 17.9 MB (12.22%) - LeetHub

Author: hogan-tech

0094-binary-tree-inorder-traversal/0094-binary-tree-inorder-traversal.py

@@ -0,0 +1,22 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
+        result = []
+
+        def traverse(node):
+            if node is None:
+                return
+            if node.left:
+                traverse(node.left)
+            result.append(node.val)
+            if node.right:
+                traverse(node.right)
+            return
+        
+        traverse(root)
+        return result