Answer Posted / hanuman
Not all tree takes O(logn) time. but only BST takes O(logn) time just because it search,insert, delete node using mid element that means complexity of that tree is O(logn).
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Is selection sort greedy?
What is mean by sorting?
Describe tree rotation in avl tree.
What is a 2 dimensional array?
Is arraylist better than array?
What is peep stack?
How treemap orders the elements if the key is a string?
What is the best case for bubble sort?
What are hash tables good for?
Why null is not allowed in treemap?
Explain what is the data structures used to perform recursion?
Define a linear data structure.
Who invented quicksort?
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
What is default array size?
