What is the result of a pre-order traversal of the binary tree with root 1, left

What is the result of a pre-order traversal of the binary tree with root 1, left child 2, and right child 3?

What is the result of a pre-order traversal of the binary tree with root 1, left child 2, and right child 3?

Step 1: Identify the root of the binary tree. The root is 1.
Step 2: In pre-order traversal, visit the root first. So, we write down 1.
Step 3: Next, move to the left child of the root. The left child is 2.
Step 4: Visit the left child (2) and write it down. Now we have 1, 2.
Step 5: After visiting the left child, move to the right child of the root. The right child is 3.
Step 6: Visit the right child (3) and write it down. Now we have 1, 2, 3.
Step 7: The pre-order traversal is complete. The final result is 1, 2, 3.

No concepts available.