Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / 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 |
Post New Answer View All Answers
Differentiate between comparable and comparator.
Which sorting is best for large data?
How to increase stack limit in w3wp.exe?
What is difference between list set and map?
What is stable sorting method?
What is time and space complexity of bubble sort?
Explain what is a spanning tree?
In what order the elements of a hashset are retrieved?
List the area of applications of data structure.
Is array of data structure?
What is the use of data structure in real life?
Is list an array?
What you mean by sorting?
What are the disadvantages of sequential storage?
How does a heap sort work?
