From d757f871bc8e2bdecfa0814a99bb512aacff6365 Mon Sep 17 00:00:00 2001
From: Junyoung Kim <37926916+kimjunyoung90@users.noreply.github.com>
Date: Sat, 6 Dec 2025 18:08:45 +0900
Subject: [PATCH] Revert "[kimjunyoung90] WEEK 04 solutions"

---
 maximum-depth-of-binary-tree/kimjunyoung90.java |  6 ------
 merge-two-sorted-lists/kimjunyoung90.java       | 17 -----------------
 2 files changed, 23 deletions(-)
 delete mode 100644 maximum-depth-of-binary-tree/kimjunyoung90.java
 delete mode 100644 merge-two-sorted-lists/kimjunyoung90.java

diff --git a/maximum-depth-of-binary-tree/kimjunyoung90.java b/maximum-depth-of-binary-tree/kimjunyoung90.java
deleted file mode 100644
index c1d851676..000000000
--- a/maximum-depth-of-binary-tree/kimjunyoung90.java
+++ /dev/null
@@ -1,6 +0,0 @@
-public class Solution {
-    public int maxDepth(TreeNode root) {
-        if (root == null) return 0;
-        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
-    }
-}
diff --git a/merge-two-sorted-lists/kimjunyoung90.java b/merge-two-sorted-lists/kimjunyoung90.java
deleted file mode 100644
index 0e40239a7..000000000
--- a/merge-two-sorted-lists/kimjunyoung90.java
+++ /dev/null
@@ -1,17 +0,0 @@
-public class Solution {
-    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
-        //1. null 체크
-        if(list1 == null || list2 == null) {
-            return list1 != null ? list1 : list2;
-        }
-        //1. 값 비교
-        if(list1.val < list2.val) {
-            //다음 Node 비교
-            list1.next = mergeTwoLists(list1.next, list2);
-            return list1;
-        } else {
-            list2.next = mergeTwoLists(list1, list2.next);
-            return list2;
-        }
-    }
-}