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
- 71269 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / shalini
binary search tree=(2^n)-n i.e (2^3)-3=5
binary tree=((2^n)-n)*n! i.e ((2^3)-3)*3!=30
this is the right answer!!!!
| Is This Answer Correct ? | 2 Yes | 4 No |
Post New Answer View All Answers
What are data and data types?
What is a graph?
If you do not initialize an array what will happen?
Which is faster hashmap or hashtable?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
What is data type with example?
Explain about circular linked list?
What are the advantages of linked list over array (static data structure)?
What are the applications of priority queues?
What is concept of data structure?
How many passes does bubble sort need?
What is an expression tree?
Define degree of the node?
What is heap tree?
What are the major data structures used in the following areas : network data model & hierarchical data model?
