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
Explain recursive function & what is the data structures used to perform recursion?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
What is peek in stack?
How does bogo sort work?
What are the tasks performed during postorder traversal?
What is doubly linked list?
what are the applications of Linked Lists?
What are three common types of traversals?
Define red-black trees.
What is declaring array?
Explain exception filter?
Explain set interface?
What are the advantages of bubble sort?
Explain the Array
Can we put null key in hashmap?
