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 / swapna
18 Binary trees and 3 Binary serach trees.
| Is This Answer Correct ? | 35 Yes | 99 No |
Post New Answer View All Answers
Can we null keys in treemap?
Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?
What happens if we try to insert duplicate key in hashmap?
What is the need for path compression?
What is meant by strongly connected in a graph?
What is mean by abstract data type?
How does hashset maintain order?
What are the four characteristics of algorithms?
What is time complexity of hashmap?
What is the order of b tree?
How to check array contains value or not?
How expression trees are gets represented in data structure?
How do you use merge sort?
What is array define its types?
What is the best case for bubble sort?