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 the term “percolate down”?
Explain exception filter?
What is a list of lists?
What is the similarity between a Structure, Union and enumeration?
What do you mean by disjoint set adt?
What type of variable is age?
Define heap order property?
What is pivot in quicksort?
Which algorithm is used in arrays sort?
In what data structures are pointers applied?
What is data type explain?
What are the average and worst time complexity in a sorted binary tree is
What is the difference between list, set and map?
Give the example of validating the parenthesis of expression using stack.
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential