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
- 71270 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / rohit
binary tree = n!(2^n - n).
for n =3 its 30.
for BST its 2n
C * [1/(n+1)]
n
for n=3 its 5.
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
What does list clear do?
Why do we use data structures?
what is Linked lists?
What is the difference between Array and Array List ? Explain in brief with example.
Will arraylist maintain insertion order?
When ArrayIndexOutOfBoundsException occurs?
What is bubble sort technique?
What is insertion sort technique?
Is arraylist a list?
what is the difference between dynamic as well as non - dynamic data structures.
Define shortest path?
What are the advantages of binary search over linear search?
Are collections thread safe?
What is a list of lists?
Can arraylist shrink?
