What is B+ tree?

Answers were Sorted based on User's Feedback



What is B+ tree?..

Answer / wonder

A B+ tree is a data structure in which records associated
with the search keys are at the leaves of the tree.This
provide efficient retrieval,insertion and removal of
records.Keys are triplicale to the non-leaf nodes to
provide a path to the searched record.
NT file system,JFS2 file system and Rationaldata base often
used this data structure for indices.

Is This Answer Correct ?    77 Yes 9 No

What is B+ tree?..

Answer / 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

What is B+ tree?..

Answer / amit patra

In a B+ tree all keys which are in non leaf node will point to
next leaf, So we can traverse sequentially also.

Is This Answer Correct ?    11 Yes 3 No

What is B+ tree?..

Answer / 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

What is B+ tree?..

Answer / meenakshi sen chouhan

B+ Tree Is a advanced technique of the B tree, this is used
for sorting work or data.

Is This Answer Correct ?    5 Yes 2 No

What is B+ tree?..

Answer / nani

A B+ tree is a data structure in which records associated
with the search keys are at the leaves of the tree.This
provide efficient retrieval,insertion and removal of
records.Keys are triplicale to the non-leaf nodes to
provide a path to the searched record.
NT file system,JFS2 file system and Rationaldata base often
used this data structure for indices.

Is This Answer Correct ?    11 Yes 11 No

Post New Answer

More Data Structures Interview Questions

What do you mean by spanning tree?

0 Answers   TCS,


What is the advantage of circular linked list?

0 Answers  


Write the algorithm for converting infix expression to postfix expression?

0 Answers  


Calculate the address of a random element present in a 2d array, given base address as ba.

0 Answers  


Does list maintain insertion order?

0 Answers  






What is the time complexity of hashmap get () and put () method?

0 Answers  


What is the difference between a hashmap and hashtable?

0 Answers  


Describe the merge sort principle and what will be its time complexity?

1 Answers   Wipro,


Which sorting algorithm is worst?

0 Answers  


What is time complexity of quick sort?

0 Answers  


What are binary trees?

0 Answers  


what is traversal in linked lists?

0 Answers  


Categories