Given a binary tree where each node contains a unique value, which of the…
2025
Given a binary tree where each node contains a unique value, which of the following operations would be performed first during a recursive preorder traversal?
- A.
Process the current node's value
- B.
Visit the left child before visiting the current node
- C.
Check if the left and right children are null before any operation
- D.
Traverse the right child of the current node
Attempted by 198 students.
Show answer & explanation
Correct answer: A
Preorder traversal visits the root node first, then recursively traverses the left subtree, and finally the right subtree. This means the very first operation performed is processing or visiting the root node of the binary tree.