solved BST + BFS

Author: Ataba29

Easy/530.py

@@ -0,0 +1,28 @@
+# Definition for a binary tree node.
+from typing import Optional
+
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+
+class Solution:
+    def getMinimumDifference(self, root: Optional[TreeNode]) -> int:
+        inres = []
+
+        def inorder(node):
+            if not node:
+                return
+            inorder(node.left)
+            inres.append(node.val)
+            inorder(node.right)
+
+        inorder(root)
+        inres[::-1]
+        res = inres[1] - inres[0]
+        for i in range(1, len(inres)):
+            res = min(inres[i] - inres[i - 1], res)
+        return res

Easy/637.py

@@ -0,0 +1,30 @@
+# Definition for a binary tree node.
+from collections import deque
+from typing import List, Optional
+
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+
+class Solution:
+    def averageOfLevels(self, root: Optional[TreeNode]) -> List[float]:
+        res = []
+
+        q = deque()
+        q.append(root)
+        while q:
+            summ = 0
+            length = len(q)
+            for i in range(length):
+                node = q.popleft()
+                summ += node.val
+                if node.right:
+                    q.append(node.right)
+                if node.left:
+                    q.append(node.left)
+            res.append(summ / length)
+        return res

Medium/103.py

@@ -0,0 +1,33 @@
+# Definition for a binary tree node.
+from collections import deque
+from typing import List, Optional
+
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+
+class Solution:
+    def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
+        if not root:
+            return []
+        directon = 1
+        res = []
+        q = deque()
+        q.append(root)
+        while q:
+            curr = []
+            length = len(q)
+            for i in range(length):
+                node = q.popleft()
+                if node.left:
+                    q.append(node.left)
+                if node.right:
+                    q.append(node.right)
+                curr.append(node.val)
+            res.append(curr[::directon])
+            directon *= -1
+        return res

README.md

@@ -17,11 +17,11 @@ This repository contains my solutions to various LeetCode problems. Each solutio
 
 ### Easy Problems
 
-- **Total Solved:** [50]
+- **Total Solved:** [52]
 
 ### Medium Problems
 
-- **Total Solved:** [128]
+- **Total Solved:** [129]
 
 ### Hard Problems