Recall & Review
beginner
What is preorder tree traversal?
Preorder traversal means visiting the root node first, then the left subtree, and finally the right subtree.
Click to reveal answer
beginner
In preorder traversal, which node is visited first?
The root node is visited first in preorder traversal.
Click to reveal answer
beginner
What is the order of visiting nodes in preorder traversal?
The order is Root -> Left subtree -> Right subtree.
Click to reveal answer
intermediate
How does preorder traversal differ from inorder traversal?
Preorder visits root first, then left and right. Inorder visits left subtree first, then root, then right subtree.
Click to reveal answer
beginner
Write the preorder traversal output for this tree:<br>Root: 1<br>Left child: 2<br>Right child: 3
The preorder traversal visits nodes in this order: 1 -> 2 -> 3
Click to reveal answer
In preorder traversal, which node is visited second?
✗ Incorrect
After visiting the root, preorder traversal visits the left subtree first.
What is the correct order of nodes visited in preorder traversal?
✗ Incorrect
Preorder traversal visits the root first, then left subtree, then right subtree.
Which traversal visits the root node first?
✗ Incorrect
Preorder traversal always visits the root node first.
If a tree has only one node, what is the preorder traversal output?
✗ Incorrect
With one node, preorder traversal visits that node first and only.
Which traversal method is NOT preorder?
✗ Incorrect
Left, Root, Right is inorder traversal, not preorder.
Explain how preorder traversal works on a binary tree.
Think about the order you would read a family tree starting from the top.
You got /4 concepts.
Describe the difference between preorder and inorder traversal.
Focus on when the root node is visited in each traversal.
You got /4 concepts.