Traversing a binary tree in preorder is equivalent to （）.

A． Traversing the forest corresponding to the binary tree in root-first order.
B． Traversing the forest corresponding to the binary tree in root-last order.
C． Traversing the forest corresponding to the binary tree in breadth-first order.
D． None of the above.