5 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
Loading...
Next Question

Overall Stats

Attempted 324
Correct 36
Incorrect 112
Viewed 176

Answers

Guest
Guest
Rupendrasingh Krishna - 3 years ago

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

Serkie Mekonnen
Serkie Mekonnen - 1 week ago

Serkie Mekonnen from Dessie, Ethiopia is saying 5 is correct answer

Narender Kumar
Narender Kumar - 2 weeks ago

Narender Kumar is saying 9 is correct answer

Marem Husen
Marem Husen - 1 month ago

Marem Husen from Al Musayyib, Iraq is saying 9 is correct answer

deepak kumar
deepak kumar - 1 month ago

deepak kumar is saying 7 is correct answer

Related Questions

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.

Merge sort uses ?

  • [A] Divide and conquer strategy
  • [B] Backtracking approach
  • [C] Heuristic search
  • [D] Greedy approach