Interested to Buy Any Domain ? << Click Here >> for more details...
why do tree always takes o(log n) time?
- 2 Answers
- 8143 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 |
Describe full binary tree and complete binary tree.
Explain the steps to insert data into a singly linked list?
Which sort is best for linked list?
Is merge sort better than quick?
What do you mean by hash table?
Is queue fifo or lifo?
What are the objectives of studying data structures?
List the applications of queues?
What are the scenarios in which an element can be inserted into the circular queue?
What is array in data structure with example?
What are the disadvantages of using collection classes over arrays?
What is arraylist load factor?
Windows 
