why do tree always takes o(log n) time?
- 2 Answers
- 6987 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 |
In what order the elements of a hashset are retrieved?
Why is concurrenthashmap thread safe?
What data type is array?
Can binary tree have 1 child?
Is list same as array?
What is meant by ordered and sorted in collections?
What is a b+ tree? Explain its uses.
What is binary search in programming?
What is difference between hashmap and hashtable?
Is it necessary to sort a file before searching a particular item ?
Why is quicksort so fast?
Which is the parent class of sortedset<e> class?
Windows 
