Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44236 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
Can treemap have duplicate values?
How do you determine if a binary tree is height balanced?
What do you mean by priority queue?
Why quicksort is better than merge sort?
Is hashmap part of collection?
Does hashmap maintain insertion order?
Is treeset thread safe?
What do you know about different sorting algorithms?
What do you mean by overflow and underflow?
Define 2-3-4 tree?
Is linkedlist thread safe?
What is the Role of push() and pop() method?
Define b-tree of order m?
Which language is best for data structures?
What is precision in data structures?
