Which of the following traversal combinations is insufficient to uniquely…
PYQ RSSB Computer Instructor 2026
Which of the following traversal combinations is insufficient to uniquely construct a general binary tree?
- A.
Postorder and Level-order
- B.
Inorder and Preorder
- C.
Inorder and Postorder
- D.
Inorder and Level-order
- E.
Question not attempted
Attempted by 608 students.
Sign up free to check your answer
Sign up freeLoading lesson…

