Merge pull request #2474 from grapefruit13/main

Author: grapefruit13

maximum-depth-of-binary-tree/grapefruit13.ts

@@ -0,0 +1,23 @@
+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;
+  }
+}
+
+/**
+ * Time Complexity: O(n)
+ * Space Complexity: O(h)
+ */
+function maxDepth(root: TreeNode | null): number {
+  if (root === null) return 0;
+
+  let left = maxDepth(root.left);
+  let right = maxDepth(root.right);
+
+  return 1 + Math.max(left, right);
+}

merge-two-sorted-lists/grapefruit13.ts

@@ -0,0 +1,33 @@
+class ListNode {
+  val: number;
+  next: ListNode | null;
+  constructor(val?: number, next?: ListNode | null) {
+    this.val = val === undefined ? 0 : val;
+    this.next = next === undefined ? null : next;
+  }
+}
+
+/**
+ * Time Complexity: O(n + m)
+ * Space Complexity: O(1)
+ */
+function mergeTwoLists(
+  list1: ListNode | null,
+  list2: ListNode | null
+): ListNode | null {
+  const dummy = new ListNode(0);
+  let current = dummy;
+
+  while (list1 && list2) {
+    if (list1.val < list2.val) {
+      current.next = list1;
+      list1 = list1.next;
+    } else {
+      current.next = list2;
+      list2 = list2.next;
+    }
+    current = current.next;
+  }
+  current.next = list1 || list2;
+  return dummy.next;
+}