Interested to Buy Any Domain ? << Click Here >> for more details...
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
What is bubble sort and quick sort?
What does abstract data type mean?
Calculate the efficiency of sequential search?
Why hashmap is faster than hashtable?
How memory is reserved using a declaration statement in data structure?
Which sorting method is slowest?
What is Insertion sort, selection sort, bubble sort( basic differences among the functionality of the three sorts and not the exact algorithms)?
Define balancing condition for AVL Tree.
What is an example of an array?
What is a vector element?
Can we extend an array after initialization?
Which data structure is applied when dealing with a recursive function?
Differentiate bfs and dfs?
What will be the output of below code?
Define path in a graph?
