Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44804 Views
- Syntel, I also Faced
- E-Mail Answers
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
Can you distinguish between ArrayList and Array?
What is stack and queue in data structure?
What is complexity of quicksort?
Is arraylist better than array?
Why sorting is done?
Define a priority queue?
Explain the Queue
Explain the principle of quicksort. What is its complexity?
Write the c program to insert a node in circular singly list at the beginning.
What do you mean by tree edge?
What is unhashable type list?
Can treeset have duplicates?
Which is faster array or list?
What is sorting in math?
What is the difference between Array and Array List ? Explain in brief with example.
