adplus-dvertising
frame-decoration

Question

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

a.

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

b.

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

c.

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

d.

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

Answer: (c).a b e j k n o p f c d g l m h i

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. 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...

Similar Questions

Discover Related MCQs

Q. A simple graph G with n-vertices is connected if the graph has

Q. Linked Lists are not suitable for ...................

Q. The decision tree classifier is a widely used technique for ...............

Q. Match the following :

(a) Dangling pointer    (i) Buffer replacement policy
(b) Page fault               (ii) Variable-length records
(c) List representation (iii) Object identifier
(d) Toss-immediate      (iv) Pointer-swizzling

Codes :
      (a)   (b)  (c)  (d)

Q. The time complexity of recurrence relation

T(n) = T(n/3) + T(2n/3) + O(n)

is

Q. The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is

Q. Given 0-1 knapsack problem and fractional knapsack problem and the following statements :

S1 : 0-1 knapsack is efficiently solved using Greedy algorithm.
S2 : Fractional knapsack is efficiently solved using Dynamic programming.

Which of the following is true ?

Q. Consider the following sequence of operations :

(i) Pointer p1 is set to point at a new heap-dynamic variable.
(ii) Pointer p2 is assigned p1’s value.
(iii) The heap dynamic variable pointed to by p1 is explicitly de-allocated, but p2 is not changed by the operation.

This situation leads to which of the following :

Q. Cyclometric complexity of a flow graph G with n vertices and e edges is

Q. For a B-tree of height h and degree t, the total CPU time used to insert a node is

Q. The time complexity to build a heap with a list of n numbers is

Q. The value of postfix expression:

8 3 4 + - 3 8 2 / + * 2 $ 3+ is

Q. Consider the following statements for priority queue:

S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
S2: The elements of a priority queue may be complex structures that are ordered on one or several fields.

Which of the following is correct?

Q. Give as good a big-O estimate as possible for the following functions:

(nlogn+n^2)(n^3+2) and (n!+2^n)(n^3+log(n^2+ 1))

Q. In any n-element heap, the number of nodes of height h is

Q. A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that

Q. Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation?

Q. The postfix expression AB+CD–* can be evaluated using a

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

Q. The number of colours required to properly colour the vertices of every planer graph is