Interested to Buy Any Domain ? << Click Here >> for more details...
why do tree always takes o(log n) time?
- 2 Answers
- 8014 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 |
When new data are to be inserted into a data structure?
What is circular linked list?
How do we find duplicate elements in an array?
What do you mean by general trees?
Define balance factor of a node in avl tree?
How to find if linked list has loop?
Give one example of right rotation.
What is a stable sort?
List the data structures which are used in hierarchical data model.
When would you use a hashmap?
Name the areas in which you can apply data structures extensively?
When is a binary search best applied?
Windows 
