How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
Answer Posted / baljinder
1oth answer is xactly correst ie,BST=5 & BT=30
| Is This Answer Correct ? | 5 Yes | 1 No |
Post New Answer View All Answers
What is a map in programming?
What is difference between set and map?
What is the difference between static and dynamic data?
What do you mean by spanning tree?
What are different techniques for making hash function?
What is vector and types of vector?
What is meant by linked list?
What is the purpose of thread?
Does treemap allow duplicate keys?
What is ds heap sort?
Can hashmap be sorted?
Is hashmap a collection?
What is the minimization factor and time complexity of b-tree?
Which is the best book for data structures and algorithms?
Explain the most efficient method to reverse a linked list?