BFS /** * 2 ways of traversing a tree. * - Breadth First Search (BFS) * - Depth First Search (DFS) * * BFS (Steps - Iteratively) * - Create a queue(this can be an array) and a variable to store the values of nodes visited. * - Place the root node in the queue. * - Loop as long as there is anything in the queue. * > Dequeue a node from the queue and push the value of the node into the variable th..