Walk this tree in level-order order: one level at a time, top to bottom, left to right.
A binary search tree with 7 nodes. Walking it in level-order order, which visits one level at a time, top to bottom, left to right.
50 is the root, and level order starts at the top.
Visiting 50, number 1 of 7. The order so far is 50.
30 comes off the front of the queue, and its children join the back.
Visiting 30, number 2 of 7. The order so far is 50, 30.
70 comes off the front of the queue, and its children join the back.
Visiting 70, number 3 of 7. The order so far is 50, 30, 70.
20 comes off the front of the queue, and its children join the back.
Visiting 20, number 4 of 7. The order so far is 50, 30, 70, 20.
40 comes off the front of the queue, and its children join the back.
Visiting 40, number 5 of 7. The order so far is 50, 30, 70, 20, 40.
60 comes off the front of the queue, and its children join the back.
Visiting 60, number 6 of 7. The order so far is 50, 30, 70, 20, 40, 60.
80 comes off the front of the queue, and its children join the back. That is the last one.
Visiting 80, number 7 of 7. The order so far is 50, 30, 70, 20, 40, 60, 80.
The level-order walk is 50, 30, 70, 20, 40, 60, 80.
The level-order traversal visited 50, 30, 70, 20, 40, 60, 80.