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
- 71316 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / hazrat hussain
Formula For BST is
{(2n)!/(n!*n)}/(n+1)
So for
N=1 BST=1
N=2 BST=2
N=3 BST=5
N=4 BST=14
N=5 BST=42
and so on
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
Explain about map and their types?
What is the logic to reverse the array?
What is sequential search?
Define the term “percolate down”?
What is sorting in data structure?
Which is more efficient merge sort vs quicksort?
What is arraylist load factor?
Explain what are the methods available in storing sequential files ?
Define an equivalence relation?
Can you please explain the difference between string and an array?
Write a Program for Linked list manipulation.
What is data in computer science?
Can hashmap have duplicate keys?
Differentiate between push and pop?
What is difference between rb tree and avl tree?
