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
Why is quicksort not stable?
What is an expression tree?
Can we insert null in hashset?
What is a treemap chart?
Explain quick sort?
Can a hashset contain duplicates?
Why is data structure?
Name the areas in which you can apply data structures extensively?
What is the difference between an array and vector?
Does hashmap preserve insertion order?
Name few classes that implement collection interface?
Is bubble sort adaptive?
Why is hashset not ordered?
What is the order of selection sort?
How many passes does bubble sort need?
