How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
- 28 Answers
- 71571 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / vipul
number of binary search tree= (2n)!/{n!*(n+1)!}
and number of binary tree=(2n)!/(n+1)!
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
What are the advantages of modularity?
Why use a tuple instead of a list?
How do you create a tree diagram?
Which language is best for data structures?
How does threaded binary tree represented in data structure?
Can you override methods of arraylist?
What are the types of collection?
What is the best sorting technique?
How do hash tables work?
Can we define the size of arraylist?
What is array define its types?
How do you do a heap sort?
Can we increase the size of statically allocated array?
What do you mean by free pool?
What is frozenset?
