Solve LeetCode 75 binary tree BFS problems

Author: THammami01

LeetCode-75/39-199.ts

@@ -0,0 +1,36 @@
+// https://leetcode.com/problems/binary-tree-right-side-view/description/?envType=study-plan-v2&envId=leetcode-75
+
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+// @ts-nocheck
+const rightSideView = (root: TreeNode | null): number[] => {
+  if (root === null) return [];
+
+  const values = [];
+  const queue = [root];
+
+  while (queue.length) {
+    const initialQueueLength = queue.length;
+
+    for (let i = 0; i < initialQueueLength; i++) {
+      const current = queue.shift();
+      if (i === initialQueueLength - 1) values.push(current.val);
+      if (current.left) queue.push(current.left);
+      if (current.right) queue.push(current.right);
+    }
+  }
+
+  return values;
+};

LeetCode-75/40-1161.ts

@@ -0,0 +1,45 @@
+// https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/description/?envType=study-plan-v2&envId=leetcode-75
+
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+// @ts-nocheck
+const maxLevelSum = (root: TreeNode | null): number => {
+  const queue = [root];
+
+  let level = 1,
+    maxSum = root.val,
+    maxLevel = 1;
+
+  while (queue.length) {
+    const initialQueueLength = queue.length;
+    let tempSum = 0;
+
+    for (let i = 0; i < initialQueueLength; i++) {
+      const current = queue.shift();
+      tempSum += current.val;
+      if (current.left) queue.push(current.left);
+      if (current.right) queue.push(current.right);
+    }
+
+    if (tempSum > maxSum) {
+      maxLevel = level;
+      maxSum = tempSum;
+    }
+
+    level++;
+  }
+
+  return maxLevel;
+};

README.md

@@ -69,8 +69,8 @@
 
 ### Binary Tree - BFS
 
-- [ ] 39. Binary Tree Right Side View
-- [ ] 40. Maximum Level Sum of a Binary Tree
+- [X] 39. Binary Tree Right Side View
+- [X] 40. Maximum Level Sum of a Binary Tree
 
 ### Binary Search Tree