Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 77053 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
What are different sorting algorithms?
Why do we use stacks?
What is type structure?
How is the front of the queue calculated in data structure?
Difference between arrays and linked list?
What is perfect binary tree?
Is quicksort divide and conquer?
What is fibonacci search?
Why linked lists are better than arrays?
How to compare Two Arrays?
Does arraylist shrink?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
Can we add or delete an element after assigning an array?
What is merge sort in daa?
What is dequeue operation?
