recategorized by
2,099 views
2 votes
2 votes

The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.

  1. ABFCDE
  2. ADBFEC
  3. ABDECF
  4. ABDCEF
recategorized by

1 Answer

2 votes
2 votes

Although it is not possible to draw a unique tree with only postorder . under the given circumstances we will choose the possible ans which is given as below

Related questions

1 votes
1 votes
2 answers
1
makhdoom ghaya asked Aug 21, 2016
2,930 views
The number of nodes in a complete binary tree of height $h$ (with roots at level $0$) is equal to$2^{0} + 2^{1} + ….. 2^{h}$$2^{0} + 2^{1} + ….. 2^{h-1}$ $2^{0} + 2^{...
3 votes
3 votes
1 answer
2
makhdoom ghaya asked Aug 12, 2016
2,447 views
Which of the following is a bad example of recursion ?FactorialFibonacci numbersTower of HanaiTree traversal
1 votes
1 votes
4 answers
3
makhdoom ghaya asked Aug 21, 2016
3,526 views
What is the probability of choosing correctly an unknown integer between $0$ and $9$ with $3$ chances ?$\frac{963}{1000}$$\frac{973}{1000}$$\frac{983}{1000}$$\frac{953}{1...
1 votes
1 votes
2 answers
4
makhdoom ghaya asked Aug 21, 2016
1,461 views
A telephone conference call is an example of which type of communications ?Same time / same placeSame time / different placeDifferent time / different placeDifferent time...