Vidyalelo
Data Structure · Q17

Trees in Data Structures

Programming · Data Structure · question 17

Q17

What type of tree traversal involves visiting the root node, then recursively visiting the left subtree, and finally the right subtree?

A.
Preorder
Answer
B.
Inorder
C.
Postorder
D.
Level-order

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board