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
Please Help Members By Posting Answers For Below Questions
How many sorting algorithms are there?
Why is sorting important?
Have you ever used HashTable and Directory?
What is the use of threaded binary tree?
Define avl tree?
What are the disadvantages of sequential storage?
Write program for Bubble Sort ?
Is an arraylist an object?
How do hash tables work?
What is dangling pointer and how to avoid it?
What do you mean by data and data structure?
Is quicksort recursive?
What is a cycle or a circuit?
What is the slowest sorting algorithm?
do records fall under linear or non linear data structures?
