From 147abcfaf6b5ca8c19cc4d86593af20a6d324408 Mon Sep 17 00:00:00 2001
From: Rytxxx <k.ryuto.5@icloud.com>
Date: Thu, 30 Oct 2025 23:59:36 -0700
Subject: [PATCH] tree

---
 Trees/Binary_Tree_Level.java | 42 ++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 Trees/Binary_Tree_Level.java

diff --git a/Trees/Binary_Tree_Level.java b/Trees/Binary_Tree_Level.java
new file mode 100644
index 0000000..8457c5c
--- /dev/null
+++ b/Trees/Binary_Tree_Level.java
@@ -0,0 +1,42 @@
+package Trees;
+
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+
+class Solution {
+    List<List<Integer>> res = new ArrayList<>();
+
+    public List<List<Integer>> levelOrder(TreeNode root) {
+        traverse(root, 0);
+        return res;
+    }
+
+    private void traverse(TreeNode node, int depth) {
+        if (node == null) {
+            return;
+        }
+
+        if (res.size() == depth) {
+            res.add(new ArrayList<>());
+        }
+
+        res.get(depth).add(node.val);
+        traverse(node.left, depth + 1);
+        traverse(node.right, depth + 1);
+    }
+
+    
+}