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
What are the advantages of linked list over array (static data structure)?
Which data structures are used in bfs and dfs algorithm?
How does linkedhashset work internally?
Can arraylist store primitives?
Define 2-3-4 tree?
Explain how is linked list implemented?
What is the difference between a stack and an array?
What is the use of prototype?
Does arraylist have a tostring?
What are the different binary tree traversal techniques?
Can treeset contain null?
What is integer max_value?
Explain the uses of b+ tree.
What are the advantages of merge sort?
What are the tasks performed during postorder traversal?
