why do tree always takes o(log n) time?
- 2 Answers
- 8335 Views
- TCS, I also Faced
- E-Mail Answers
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 |
What is the best complexity of bubble sort?
What are the major data structures used in the network data model?
What is garbage collection in data structure?
How does arraylist size work?
What is hash data type?
What is the similarity between a Structure, Union and enumeration?
Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?
How does a selection sort work for an array?
Define left-in threaded tree?
What happens when arraylist is full?
What is data structure what is need of it?
What do you mean by sorting data?
Windows 
