Level Order Traversal Using Queue

Author: otienogeoffrey812

README.md

@@ -1 +1,20 @@
 # Binary-Tree-Algorithms
+
+* Insert
+* Find
+* Height of a tree
+* Minimum Value In A Tree
+* Equality Between Trees
+* Validating A Binary Search Tree
+* Nodes At K Distance
+* Print Leaves
+* Sum Of Nodes
+* Invert Binary Tree
+* Depth First Traversals
+  - PreOrder
+  - InOrder
+  - PostOrder
+* Breadth First Search / Level Order Traversal
+  - Using Height Of Tree And Nodes At K Distance 
+  - Using Queue
+

src/main/java/org/example/Tree.java

@@ -1,7 +1,9 @@
 package org.example;
 
 import java.util.ArrayList;
+import java.util.LinkedList;
 import java.util.List;
+import java.util.Queue;
 
 public class Tree {
     private class Node{
@@ -174,6 +176,25 @@ public void levelOrderTraversal() {
             nodesAtKDistance(i).forEach(System.out::println);
         }
     }
+    public void levelOrderTraversalUsingQueue(){
+        if (root == null) return;
+
+        Queue<Node> queue = new LinkedList<>();
+        queue.add(root);
+
+        while (!queue.isEmpty()){
+            var current  = queue.poll();
+            System.out.println(current);
+
+            if (current.leftChild != null ){
+                queue.add(current.leftChild);
+            }
+
+            if (current.rightChild != null) {
+                queue.add(current.rightChild);
+            }
+        }
+    }
     public void printLeaves(){
         printLeaves(root);
     }