Q3
Which traversal method of a binary tree involves visiting the left subtree, then the root, and then the right subtree?
A.
Inorder
AnswerB.
Preorder
C.
Postorder
D.
Level-order
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board