Answer the previous question for the case when T is a proper binary tree with more than one node. Consider the example of a breadth-first traversal given in Figure 8.17. Using the annotated numbers...

with more than one node.

Consider the example of a breadth-first traversal given in Figure 8.17.

Using the annotated numbers from that figure, describe the contents of

the queue before each pass of the while loop in Code Fragment 8.14. To

get started, the queue has contents {1} before the first pass, and contents

{2,3,4} before the second pass.