Breadth-first traversal of Binary Trees

For the breadth-first traversal of a binary tree, that is, traverse by hierarchy. Traverse the root node sequentially, followed by the left and right children. Here, we need to output data according to the sequence of the left and right children, so it is the principle of first-in-first-out, so of course we will think of it.QueueThis data structure. You can insert left and right children in rear sequence, and read and delete left and right children in front sequence to ensure hierarchical output.

Void breathfirstsearch (btree * root) {queue <btree *> queue = new Queue (); queue. enqueue (Root); While (! Queue. isempty () {root = queue. front (); printf ("% C", root-> data); queue. dequeue (); If (root-> lchild! = NULL) {queue. enqueue (root-> lchild);} If (root-> rchild! = NULL) {queue. enqueue (root-> rchild );}}}