what is the different between B-tree and B+ tree.
- 8 Answers
- 41554 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
Explain the Linked List
Can hashset contain null?
Write a program using mergesort technique.
What does the term sorting refer to?
Will it create any problem if we add elements with key as user defined object into the treemap?
How do you find the space complexity of a bubble sort?
Why is the isempty() member method called?
why boundary tag representation is used?
Write the procedure to convert general tree to binary tree?
What is the meaning of arraylist?
What is arrays copyof?
How does variable declaration affect memory allocation?
What is worst case complexity algorithm?
What is a B tree?
Check if duplicates exist in an array of N which has range 1 to N.
