adplus-dvertising
frame-decoration

Question

The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively.The post order traversal is ______________.

a.

dbefacg

b.

debfagc

c.

dbefcga

d.

debfgca

Answer: (d).debfgca

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively.The post order traversal is ______________.

Similar Questions

Discover Related MCQs

Q. Level order Traversal of a rooted Tree can be done by starting from root and performing

Q. The average case occurs in the Linear Search Algorithm when :

Q. To determine the efficiency of an algorithm the time factor is measured by

Q. Which of the following algorithms sort n integers, having the range 0 to (n^2 - 1), in ascending order in O(n) time ?

Q. Which of the following is asymptotically smaller?

Q. Code blocks allow many algorithms to be implemented with the following parameters:

Q. Consider f(N) = g(N) + h(N) 
Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? 

Q. The reverse polish notation equivalent to the infix expression
((A + B) * C+ D)/(E + F + G)

Q. Superficially the term "object-oriented", means that, we organize software as a

Q. The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ____ and ____ respectively.

Q. When a method in a subclass has the same name and type signatures as a method in the superclass, then the method in the subclass ______ the method in the superclass.

Q. Consider the following operations performed on a stack of size 5:
Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e);
Which of the following statements is correct?

Q. Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be

Q. Which of the following is not an inherent application of stack?

Q. In how many ways can the string
A∩B - A ∩ B -A
be fully parenthesized to yield an infix expression ?

Q. The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............

Q. Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array?

Q. The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ...................

Q. What features make C++ so powerful ?

Q. The mechanism that binds code and data together and keeps them secure from outside world is known as