recategorized
4,798 views
1 votes
1 votes

Consider the In-order and Post-order traversals of a tree as given below:

In-order: j e n k o p b f a c l g m d h i

Post-order: j n o p k e f b c l m g h I d a

The Pre-order traversal of the tree shall be

  1. a b f e j k n o p c d g l m h i
  2. a b c d e f j k n o p g l m h i
  3. a b e j k n o p f c d g l m h i
  4. j e n o p k f b c l m g h I d a
recategorized

1 Answer

4 votes
4 votes

If we consider given In-order and Post Order and construct the tree then no option is going to match .

                  

This is the tree with given in-order  and post-order

If you traverse it from top to bottom left to right and print each element second time then we are going to get the exact in-order given in question .

if we print the element last time then we are going to get the post-order. But for pre-order it does not give us any option from given options, So correct pre-order should be 

Preorder : abejknpofdglcmih

Answer:

Related questions

1 votes
1 votes
1 answer
1
shivani2010 asked Jun 9, 2016
4,136 views
The min. number of nodes in a binary tree of depth d (root at level 0) is$(2^d + 1)$$(2^{(d+1)} - 1)$$d$$d + 1$
1 votes
1 votes
2 answers
2
go_editor asked Jul 20, 2016
4,478 views
The efficient data structure to insert/delete a number in a stored set of number isQueueLinked listDoubly linked listBinary tree