Answer Posted / ankita dey
In the B+ tree , all keys are maintained in leaves, and
keys are replicated in non leaf nodes to define path for
locating individual records. The leaves are linked together
to provide a sequential path for traversing the keys in the
tree.
| Is This Answer Correct ? | 7 Yes | 2 No |
Post New Answer View All Answers
What do you mean by garbage collection?
Explain the difference between hashset and hashmap?
Why do we need algorithm?
In what areas do data structures are applied?
How does shell sort work?
Why linked list is required?
What do you mean by data and data structure?
Why sorting is done?
Differentiate between an array and an arraylist.
Discuss how to implement queue using stack.
How memory is reserved using a declaration statement ?
Is arraylist a list?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
What is nsmutablearray?
What is difference between hashset and treeset?
