Interested to Buy Any Domain ? << Click Here >> for more details...
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
Why do we use dynamic arrays?
List the limitations of linear probing?
Define splay tree?
Describe the complexity of Quick Sort
What are binary search and fibonacci search?
Give one example of right rotation.
Why is null not allowed in concurrenthashmap?
What is the difference between push and pop?
Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?
Can you declare an array without assigning the size of an array?
What is time complexity of binary search?
Define red-black trees.
Which is better stack or queue?
What is an expression tree?
Which time complexity is best?
