Tree

Author: Alimov-8

Data Structure 1/144. Binary Tree Preorder Traversal.md

@@ -0,0 +1,36 @@
+# Leetcode 144. Binary Tree Preorder Traversal
+## Tree
+
+### Runtime: 39 ms, faster than 63.48% of Python3 submissions
+```py
+# Time Complexity -
+
+# Logic - NLR
+
+# 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 preorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
+        
+        nodes = list()
+        
+        def preorder(root):
+            
+            if not root:
+                return 0
+            
+            
+            
+            nodes.append(root.val)
+            
+            preorder(root.left)
+            preorder(root.right)
+        
+        preorder(root)
+        return nodes
+```

Data Structure 1/145. Binary Tree Postorder Traversal.md

@@ -0,0 +1,34 @@
+# Leetcode 145. Binary Tree Postorder Traversal
+## Tree
+
+### Runtime: 64 ms, faster than 6.67% of Python3 
+```py
+# Time Complexity -
+
+# Logic - LNR
+
+# 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 postorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
+        nodes = list()
+        
+        def postorder(root):
+            
+            if not root:
+                return 0
+            
+            
+            postorder(root.left)
+            postorder(root.right)
+            nodes.append(root.val)
+        
+        postorder(root)
+        return nodes
+        
+```

Data Structure 1/94. Binary Tree Inorder Traversal.md

@@ -0,0 +1,35 @@
+# Leetcode 94. Binary Tree Inorder Traversal
+## Tree
+
+### Runtime: 60 ms, faster than 12.36% of Python3
+```py
+# Time Complexity -
+
+# Logic - LNR
+
+# 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]:
+        
+        nodes = list()
+        
+        def inorder(root):
+            
+            if not root:
+                return 0
+            
+            
+            inorder(root.left)
+            nodes.append(root.val)
+            inorder(root.right)
+        
+        inorder(root)
+        return nodes
+        
+```

Data Structure 1/README.md

@@ -18,12 +18,18 @@
 
 - [88. Merge Sorted Array - Two Pointers, Compersion Sorting](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/88.%20Merge%20Sorted%20Array.md#leetcode-88-merge-sorted-array)
 
+- [94. Binary Tree Inorder Traversal - Tree](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/)
+
 - [118. Pascal's Triangle - Array](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/118.%20Pascal's%20Triangle.md#leetcode-118-pascals-triangle)
 
 - [121. Best Time to Buy and Sell Stock](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md#leetcode-121-best-time-to-buy-and-sell-stock)
 
 - [141. Linked List Cycle - Hashmap, Loop](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/203.%20Remove%20Linked%20List%20Elements.md#203-remove-linked-list-elements)
 
+- [144. Binary Tree Preorder Traversal - Tree](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/)
+
+- [145. Binary Tree Postorder Traversal - Tree](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/)
+
 - [203. Remove element from LinkedList - Recursion](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/203.%20Remove%20Linked%20List%20Elements.md#203-remove-linked-list-elements)
 
 - [206. Reverse the LinkedList - Recursion](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/203.%20Remove%20Linked%20List%20Elements.md#203-remove-linked-list-elements)