7 years ago in Data Structure

The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is ?

[A] 3
[B] 9
[C] 7
[D] 5
Next Question

Create your Digital Resume For FREE on your name's sub domain "yourname.wcard.io". Register Here!

Overall Stats

Attempted 344
Correct 38
Incorrect 118
Viewed 188


Rupendrasingh Krishna - 4 years ago

(2n)!/(n+1)!*n! so n=3 we get 5 answer is d

Abdul Majid
Abdul Majid - 4 months ago

Abdul Majid from Pakistan is saying 5 is correct answer

Hemashree Raja
Hemashree Raja - 8 months ago

Hemashree Raja is saying 5 is correct answer

Miethali Kulkarni
Miethali Kulkarni - 9 months ago

Miethali Kulkarni is saying 3 is correct answer

19C091_ SHALINI PRIYA R - 10 months ago

19C091_ SHALINI PRIYA R is saying 3 is correct answer

Related Questions

The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

  • [A] 2 deletions and 3 additions
  • [B] 3 additions and 2 deletions
  • [C] 3 deletions and 3 additions
  • [D] 3 deletions and 4 additions

Which of the following statement is true ?

  • [A] Optimal binary search tree construction can be performed efficiently using dynamic programming.
  • [B] Breath first search cannot be used to find converted components of a graph.
  • [C] Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
  • [D] Depth first search can be used to find connected components of a graph.

Linked list are not suitable data structure of which one of the following problems ?

  • [A] Insertion sort
  • [B] Binary search
  • [C] Radix sort
  • [D] Polynomial manipulation