In-order traversal of a binary search tree yields the keys in sorted order. Level-order uses a queue and visits the tree row by row.
Tree traversal
A systematic order for visiting every node: pre-order, in-order, post-order or level-order.
In-order traversal of a binary search tree yields the keys in sorted order. Level-order uses a queue and visits the tree row by row.