why do tree always takes o(log n) time?

Answers were Sorted based on User's Feedback



why do tree always takes o(log n) time?..

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

why do tree always takes o(log n) time?..

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

Post New Answer

More Data Structures Interview Questions

Which sorting algorithm uses minimum number of swaps?

0 Answers  


What is the best time complexity of bubble sort?

0 Answers  


What do you mean by an Array?

0 Answers  


Write program for Quick sort ?

0 Answers  


Define threaded binary tree.

0 Answers  






What is array and its types?

0 Answers  


Explain circular linked list?

0 Answers  


What is array simple?

0 Answers  


Define a complete binary tree?

0 Answers  


How do you find the depth of a binary tree?

0 Answers  


How do hash tables work?

0 Answers  


Is vector synchronized?

0 Answers  


Categories