Breadth first traversal

Author: aditya43

13-Tree-Traversal-Algorithms/01-BFS.js

@@ -37,6 +37,17 @@ class BinarySearchTree {
         }
     }
 
+    /**
+     * 1. Create a queue (this can be an array) and a variable to store the
+     * values of nodes visited
+     * 2. Place the root node in the queue
+     * 3. Loop as long as there is anything in the queue
+     * 4. Dequeue a node from the queue and push the value of the
+     * node into the variable that stores the nodes
+     * 5. If there is a left property on the node dequeued - add it to the queue
+     * 6. If there is a right property on the node dequeued - add it to the queue
+     * 7. Return the variable that stores the values
+     */
     breadthFirstSearch () {
         if (!this.root) {
             return -1;