why do tree always takes o(log n) time?
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / 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 |
Which sorting algorithm uses minimum number of swaps?
What is the best time complexity of bubble sort?
What do you mean by an Array?
Write program for Quick sort ?
Define threaded binary tree.
What is array and its types?
Explain circular linked list?
What is array simple?
Define a complete binary tree?
How do you find the depth of a binary tree?
How do hash tables work?
Is vector synchronized?