Preorder Tree Traversal

Preorder visits nodes in this order: Root → Left → Right.

Step: 0/0 · Output size: 0 · Speed:
Binary tree
Traversal = Preorder
Rule = Root → Left → Right
Phase = Idle
Traversal output
The root is always visited first in preorder traversal.