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
Describe full binary tree and complete binary tree.
Define the graph data structure?
Can you declare an array without assigning the size of an array?
Explain multiply linked list in short.
Define a set?
What is vector and types of vector?
What is the purpose of sorting algorithms?
Are linked lists useful?
Define back edge?
What is the heap in data structures?
Write the recursive c function to count the number of nodes present in a binary tree.
Can we store null in arraylist?
What are the disadvantages of representing a stack or queue by a linked list?
Define depth and height of a node?
If I try to add enum constants to a treeset, what sorting order will it use?