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
Define the term “percolate up”?
How do you do a heap sort?
What is difference between hashset and treeset?
Name few collections map implementations?
What will happen if an array goes out of bounds?
Which sort is stable?
Which is the best book for data structures and algorithms?
Explain the difference between a list and array.
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
Define level of the tree?
What are the types of bulleted list?
Is hashmap get thread safe?
What is dynamic array how it is created?
How would you sort words in a large file?
Can we define the size of arraylist?