Interested to Buy Any Domain ? << Click Here >> for more details...
why do tree always takes o(log n) time?
- 2 Answers
- 8258 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 difference between concurrenthashmap and hashtable?
What is the meaning of arraylist?
What is the use of data structure?
Which is the parent class of hashmap class?
Can we use Generics with the array?
Explain about circular linked list?
Which collection is used for sort?
What is Doubly link list?
Why might quick sort might be better than merge sort?
Which file contains the definition of member functions?
What is bubble sort technique?
What is non linear data structure with example?
Windows 
