Code review fix

Author: albina-astr

src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java

@@ -5,11 +5,8 @@
 import java.util.List;
 import java.util.Queue;
 
-/* Class to print Level Order Traversal */
 public class LevelOrderTraversal {
 
-    /* Given a binary tree. Print its nodes in level order
-  using array for implementing queue  */
     static List<List<Integer>> traverse(BinaryTree.Node root) {
         if (root == null) {
             return List.of();
@@ -22,19 +19,14 @@ static List<List<Integer>> traverse(BinaryTree.Node root) {
         while (!q.isEmpty()) {
             int nodesOnLevel = q.size();
             List<Integer> level = new LinkedList<>();
-            /* poll() removes the present head.
-               For more information on poll() visit
-               http://www.tutorialspoint.com/java/util/linkedlist_poll.htm */
             for (int i = 0; i < nodesOnLevel; i++) {
                 BinaryTree.Node tempNode = q.poll();
                 level.add(tempNode.data);
 
-                /*Enqueue left child */
                 if (tempNode.left != null) {
                     q.add(tempNode.left);
                 }
 
-                /*Enqueue right child */
                 if (tempNode.right != null) {
                     q.add(tempNode.right);
                 }

src/test/java/com/thealgorithms/datastructures/trees/LevelOrderTraversalTest.java

@@ -40,7 +40,7 @@ public void testLevelOrderTraversalCompleteTree() {
         / \
        2   3
       /\   /\
-     4   56  7
+     4  5 6  7
         /  \
        8    9
     */

src/test/java/com/thealgorithms/datastructures/trees/VerticalOrderTraversalTest.java

@@ -40,7 +40,7 @@ public void testVerticalTraversalCompleteTree() {
         / \
        2   3
       /\   /\
-     4   56  7
+     4  5 6  7
         /  \
        8    9
     */

src/test/java/com/thealgorithms/datastructures/trees/ZigzagTraversalTest.java

@@ -40,7 +40,7 @@ public void testZigzagTraversalCompleteTree() {
         / \
        2   3
       /\   /\
-     4   56  7
+     4  5 6  7
         /  \
        8    9
     */