8,746 views
27 votes
27 votes

Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely?

  1. preorder and postorder

  2. inorder and postorder

  3. preorder and inorder

  4. level order and postorder

  1. I only
  2. II, III
  3. III only
  4. IV only

3 Answers

Best answer
35 votes
35 votes

Following combination can uniquely identify a tree.

  • Inorder and Preorder.
  • Inorder and Postorder.
  • Inorder and Level-order.

And following do not.

  • Postorder and Preorder.
  • Preorder and Level-order.
  • Postorder and Level-order.

Answer: B

edited by
14 votes
14 votes
Option b is correct i just draw a tree wrote the preorder,inorder,postorder,level order traversals I find out the options I and IV cant derive a unique tree.
Answer:

Related questions

103 votes
103 votes
11 answers
2
62 votes
62 votes
4 answers
3
55 votes
55 votes
8 answers
4