why do tree always takes o(log n) time?
- 2 Answers
- 6985 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 |
Two linked lists are given, find out the sum of them without altering the linked list?
What is complexity of quicksort?
What is difference between hashmap and hashtable?
What is an object array?
What is a stable algorithm?
What is the method to find the complexity of an algorithm?
What is a data structure? What are the types of data structures?
how a polynomial such as 6x^6+4x^3-2x+10 can be represnted by linked list?write an algorithm that reads such an polynomial
How does bogo sort work?
What are the advantages of selecetion sort?
What are the Differences between map and hashmap?
What is data structure and why we need it?
Windows 
