Which traversal method of a binary tree involves visiting the left subtree, then the root, and then the right subtree?
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Answer: Option A
This Question Belongs to Data Structure >> Trees In Data Structures
Join The Discussion