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
Can you change size of array once created?
What is a concurrenthashmap?
Does arraylist maintain insertion order?
What is a postfix expression?
Define Data Structures?
Differentiate between compilers and interpreters.
What member function places a new node at the end of the linked list?
Is red black tree balanced?
Define tree edge?
What is the difference between Strings and Arrays?
What is time complexity of sorting algorithms?
Can arraylist have duplicates?
Define structure property in a heap?
Why do we study data structures?
What is data and its type?
