Answer Posted / nishant
a B+ tree is a type of tree which represents sorted data in
a way that allows for efficient insertion, retrieval and
removal of records, each of which is identified by a key. It
is a dynamic, multilevel index, with maximum and minimum
bounds on the number of keys in each index segment (usually
called a 'block' or 'node'). In a B+ tree, in contrast to a
B-tree, all records are stored at the lowest level of the
tree; only keys are stored in interior blocks.
The primary value of a B+ tree is in storing data for
efficient retrieval in a block-oriented storage context.
Given a storage system with a block size of b, a B+ tree
which stores a number of keys equal to a multiple of b will
be very efficient when compared to a binary search tree (the
corresponding data structure for non-block-oriented storage
contexts).
| Is This Answer Correct ? | 46 Yes | 8 No |
Post New Answer View All Answers
You want to insert a new item in a binary search tree. How would you do it?
Write an algorithm to check if there is a loop in a doubly linked list.
What is complete binary tree and almost complete binary tree?
Explain implementation of deletion from a binary tree.
What is difference between arraylist and linkedlist?
Define a set?
write a program to show the insertion and deletion of an element in an array using the position
What is ascii sort order?
Can you store different types in an array?
Explain linear linked implementation of Stack and Queue?
What is difference between while and do while?
Write the c program to insert a node in circular singly list at the beginning.
Which sort algorithm is best?
How is hashmap o 1?
What is the logic to reverse the array?
