why do tree always takes o(log n) time?
- 2 Answers
- 6957 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 link list in data structure?
How many types of linked list exist?
Which sorting technique is best in worst case?
If we try to add duplicate key to the hashmap, what will happen?
What do you mean by probing?
How to reverse singly link list?
Define avl tree?
What is an expression tree?
What is the complexity of arraylist?
What are the categories of avl rotations?
What are the objectives of studying data structures?
What is data type explain?
Windows 
