Java- In a breadth-first traversal of a binary tree, the nodes are visited in an order prescribed by their level

Subject:Computer SciencePrice: Bought3

Share With

Java- In a breadth-first traversal of a binary tree, the nodes are visited in an order prescribed by their level. First visit the node at level 1, the root node. Then visit the nodes at level 2, in left-to-right order, and so on. You can use a queue to implement a breadth-first traversal of a binary tree.

Algorithm:

1.

Insert the root node in the queue
2.

While the queue is not empty
3.

Remove a node from the queue and visit it
4.

Place references to its left and right subtrees in the queue.

Code this algorithm and test it on several binary trees.