Register

UGC NET CSE | December 2011 | Part 2 | Question: 19

• recategorized by
2,146 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
User Avatar

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

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3.0k
views
2 answers
1 votes
makhdoom ghaya asked Aug 21, 2016
2,973 views
UGC NET CSE | December 2011 | Part 2 | Question: 50
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^{...
User Avatar
2.5k
views
1 answers
3 votes
makhdoom ghaya asked Aug 12, 2016
2,492 views
UGC NET CSE | December 2011 | Part 2 | Question: 3
Which of the following is a bad example of recursion ?FactorialFibonacci numbersTower of HanaiTree traversal
User Avatar
3.6k
views
4 answers
1 votes
makhdoom ghaya asked Aug 21, 2016
3,558 views
UGC NET CSE | December 2011 | Part 2 | Question: 49
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...
User Avatar
1.5k
views
2 answers
1 votes
makhdoom ghaya asked Aug 21, 2016
1,485 views
UGC NET CSE | December 2011 | Part 2 | Question: 48
A telephone conference call is an example of which type of communications ?Same time / same placeSame time / different placeDifferent time / different placeDifferent time...
User Avatar
Link Copied!