From d0349bbcf97d52c415f387f8a981d421084ab7bd Mon Sep 17 00:00:00 2001
From: sangge-redmi <2251250136@qq.com>
Date: Fri, 7 Jun 2024 16:26:26 +0800
Subject: [PATCH] finish: 94

---
 leetcode/94.py | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 leetcode/94.py

diff --git a/leetcode/94.py b/leetcode/94.py
new file mode 100644
index 0000000..843c2c5
--- /dev/null
+++ b/leetcode/94.py
@@ -0,0 +1,25 @@
+from typing import List, Optional
+
+
+# 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]:
+        if root is None:
+            return []
+        if root.left is not None:
+            return (
+                self.inorderTraversal(root.left)
+                + [root.val]
+                + self.inorderTraversal(root.right)
+            )
+        elif root.right is not None:
+            return [root.val] + self.inorderTraversal(root.right)
+        else:
+            return [root.val]