what is the different between B-tree and B+ tree.
- 8 Answers
- 42074 Views
- Syntel, I also Faced
- E-Mail Answers
Answer Posted / shivhar bhalerao
In B-tree more no of data pointer is required to store the
data and link of the data pointer ie. tree pointer so it
required more space accommodate in database.
But in B+ tree only leaf node is required to store data and
one link pointer so space is utilization is high as compare
to B tree ............
| Is This Answer Correct ? | 8 Yes | 2 No |
Post New Answer View All Answers
What is list and types of list?
What are the 3 control structures in programming?
What are linked list?
Define a linear data structure.
Is it possible to store null key and null values in a hashmap?
What is the use of isEmpty() member methods?
What does a bubble chart show?
What is a subtree in data structures?
Explain binary tree traversals?
Define union-by-weight?
Define leaves?
Define a linear and non linear data structure.
What sorting algorithm does arrays sort use?
Why do we study data structures?
Why we need cursor implementation of linked lists?
