what is the different between B-tree and B+ tree.

Answer Posted / gajraj singh 8878250971

It's all about branching factor. Because of the way B+-Trees store records (called "satellite information") at the leaf level of the tree, they maximize the branching factor of the internal nodes. High branching factor allows for a tree of lower height. Lower tree height allows for less disk I/O. Less disk I/O theoretically means better performance
In a B- tree you can store both keys and data in the internal/leaf nodes. But in a B+ tree you have to store the data in the leaf nodes only.
A B+ - Tree is in the form of a balanced tree in which every path from the root of the tree to a leaf of the tree is the same length.
Each nonleaf node in the tree has between [n/2] and n children, where n is fixed.
B+ - Trees are good for searches, but cause some overhead issues in wasted space.

Is This Answer Correct ?    20 Yes 4 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Why is quicksort unstable?

578


Which data structures are applied when dealing with a recursive function?

698


what is a balanced tree.

687


How do you empty an arraylist?

582


What are doubly linked lists?

668






How will you represent a linked list in a graphical view?

725


Which is better than array and linked list?

586


What data structure underlies a python list?

592


State the difference between primitive and non-primitive data types?

754


Define forest?

662


What is stack in data structure with the example?

505


Does hashmap preserve insertion order?

571


Are duplicates allowed in list?

574


What is sequential search?

617


What is the default capacity of hashmap?

500