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?

  1. A.

    Postorder and Level-order

  2. B.

    Inorder and Preorder

  3. C.

    Inorder and Postorder

  4. D.

    Inorder and Level-order

  5. E.

    Question not attempted

Attempted by 608 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rssb Senior Computer Instructor

Loading lesson…