what is the different between B-tree and B+ tree.
- 8 Answers
- 41582 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 does a treemap do?
How to get top two numbers from an array?
Define separate chaining?
State the merit of linked representation of binary trees?
Explain Stack
Explain how is linked list implemented?
Which interfaces are implemented by linkedhashset?
Define b-tree of order m?
Explain Queue
Write a program to reverse a single linked list.
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
How many null values are allowed in a set?
Why do we need to recycle?
Can arraylist store objects?
Write a program for reversing the Single Linked List?
