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
How will you check the validity of an expression containing nested parentheses?
What is dynamic data structure?
Which interfaces are implemented by linkedhashset?
Describe the complexity of Binary search
What does arraylist remove return?
What is difference between map and hashmap?
Why do we need searching algorithms?
Is tuple immutable?
why boundary tag representation is used?
What happens when arraylist is full?
Can you use Bubble Sort To sort the number of elements.
What is difference between rb tree and avl tree?
What is data and its type?
What are the different types of hash functions?
Are lists mutable?