Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44448 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 a tech stack?
Why is hashmap faster than treemap?
What do you mean by articulation point?
Can you change size of array once created?
What is map data structure?
What happens if we put duplicate key in hashmap?
What are the categories of avl rotations?
What is sort in data structure?
What is sequential search? What is the average number of comparisons in a sequential search?
What is stack algorithm?
How do you sort a collection in descending order?
Which is faster hashset or treeset?
List the applications of stacks?
Why is sorting important?
What is the use of heap sort?
