Interested to Buy Any Domain ? << Click Here >> for more details...
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
Run time memory allocation is known as ?
Which sort is stable?
Mention for which header list, you will found the last node contains the null pointer?
Can treemap have duplicate values?
Why do we need sorting?
How can avl tree be useful in all the operations as compared to binary search tree?
Differentiate between arraylist and vector.
How do you search for a target key in a linked list?
Why is reflection slower?
Which is the parent class of abstractqueue class?
What is an iterative algorithm?
How do you create a tree diagram?
What is the use of substring?
Can you declare an array without assigning the size of an array?
Describe what is Node in link list? And name the types of Linked Lists?
