Interested to Buy Any Domain ? << Click Here >> for more details...
why do tree always takes o(log n) time?
- 2 Answers
- 8097 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 data in computer science?
Advanced problems related to Data Structures were asked
What is the purpose of sorting?
Define internal nodes?
How does variable declaration affect memory allocation?
What is declaring array?
What is tree in computer science?
What is a circular singly linked list?
Explain singly linked list in short.
Explain the priority queue?
Does treemap sort automatically?
Write an algorithm to show various operations on ordered list and arrays
Windows 
