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 the method to find the complexity of an algorithm?
How do you rotate an AVL tree?
What are vectors used for in real life?
What is a stable algorithm?
What is a list in data structure?
How do you do a heap sort?
Explain implementation of traversal of a binary tree.
Are linked lists considered linear or non-linear data structure?
Which sorting technique is best?
Which is faster binary or linear search?
Define probing?
Which collection is used for sort?
What does map stand for?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
What is complexity algorithm?
