Levels use a queue; depth uses a stack.

Breadth-first order visits all nodes at one depth before any deeper node. To do that, children must wait behind the nodes already waiting, which is first in, first out. Depth-first follows one branch to the bottom, which suits a stack or plain recursion. Pick the container by the order you want.

Read it once, then a question tests whether the trick stuck.