Question

Which statement about the level-order traversal of a binary tree is false?
a) It visits the nodes of a tree row by row.
b) The search begins at the root node.
c) The search begins at the row of the leftmost leaf node.
d) On each level of the tree, the nodes are visited left to right.

Answer

This answer is hidden. It contains 3 characters.