Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44447 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
In tree construction which is the suitable efficient data structure?
Does treemap allow null key?
What are the different types of data structures explain briefly?
Can an arraylist be null?
Is bucket sort a comparison sort?
What is an externalizable interface?
Which is faster quick sort or merge sort?
Questions related to arrays, such as given a 2 integer array, find the common elements.
Define a linear and non linear data structure.
In what areas do data structures are applied?
What is data structure and its classification?
How memory is reserved using a declaration statement in data structure?
What is list data structure?
Write an algorithm that counts number of nodes in the circular linked list
How do you do a mergesort?
