Which of the Following Statements About Breadth-First and Depth-First Traversal

Which of the following statements about breadth-first and depth-first traversal is NOT correct?

A) Depth-first search goes deeply into the tree and then backtracks when it reaches the leaves.
B) Breadth-first and depth-first search only work on a binary tree.
C) Breadth-first search first visits all nodes on the same level before visiting the children.
D) Depth-first search uses a stack to track the nodes that it visits.