Which traversal method would you use to get the nodes of a binary tree in pre-or

Which traversal method would you use to get the nodes of a binary tree in pre-order?

Which traversal method would you use to get the nodes of a binary tree in pre-order?

Step 1: Start at the root node of the binary tree.
Step 2: Visit the root node and record its value.
Step 3: Move to the left child of the root node.
Step 4: Repeat Step 2 for the left child (visit and record its value).
Step 5: If the left child has a left child, move to the left child and repeat Step 2.
Step 6: If there is no left child, move to the right child of the current node and repeat Step 2.
Step 7: Continue this process until all nodes in the tree have been visited.

No concepts available.