lcamhoa
diff --git a/‎src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java‎
Lines changed: 15 additions & 1 deletion b/‎src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java‎
Lines changed: 15 additions & 1 deletion
diff --git a/‎src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversalHelper.java‎
Lines changed: 0 additions & 43 deletions b/‎src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversalHelper.java‎
Lines changed: 0 additions & 43 deletions
diff --git a/‎src/main/java/com/thealgorithms/datastructures/trees/TreeTraversal.java‎
Lines changed: 0 additions & 120 deletions b/‎src/main/java/com/thealgorithms/datastructures/trees/TreeTraversal.java‎
Lines changed: 0 additions & 120 deletions
@@ -7,7 +7,7 @@
 
 public class LevelOrderTraversal {
 
-    static List<List<Integer>> traverse(BinaryTree.Node root) {
+    public static List<List<Integer>> traverse(BinaryTree.Node root) {
         if (root == null) {
             return List.of();
         }
@@ -35,4 +35,18 @@ static List<List<Integer>> traverse(BinaryTree.Node root) {
         }
         return result;
     }
+
+    /* Print nodes at the given level */
+    public static void printGivenLevel(BinaryTree.Node root, int level) {
+        if (root == null) {
+            System.out.println("Root node must not be null! Exiting.");
+            return;
+        }
+        if (level == 1) {
+            System.out.print(root.data + " ");
+        } else if (level > 1) {
+            printGivenLevel(root.left, level - 1);
+            printGivenLevel(root.right, level - 1);
+        }
+    }
 }