Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44530 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
List some applications of tree-data structure?
Is array a collection?
What is Jagged Arrays?
What is a priority queue?
What do you mean by heap order property?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
Parenthesis is never required in postfix or prefix expressions, why?
What is the procedure to insert into a sorted array?
How does hashset work internally in java?
What is difference between array and arraylist?
What are the Difference between tcp and udp?
What is an expression tree?
Is there any difference between int[] a and int a[]?
What is complexity of bubble sort?
What is binary tree and its types?
