Answer Posted / manish kumar yadav
Tree always takes o(log n) time because tree has height is
(log n).
| Is This Answer Correct ? | 24 Yes | 23 No |
Post New Answer View All Answers
What is heap and its types?
What is the difference between hashmap and linkedhashmap?
Explain the difference between a list and array.
State the merits of linear representation of binary trees?
What is an externalizable interface?
What is the difference between collection and collections?
Can we extend an array after initialization?
What do you mean by shortest path?
What are the types of algorithms?
How do you find the height of a binary tree?
What do you mean by recursive definition?
Define level of the tree?
Name few classes that implement collection interface?
Explain the uses of matrix with an example?
What is reduction to sorting method?
