Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44802 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
When is a binary search best applied?
What does arraylist remove do?
What is the procedure to insert into a sorted array?
How do you sort an array in descending order?
What is difference between capacity and size of arraylist?
Explain the term base case?
What do you mean by sorting?
Differentiate between hashset and hashmap.
What is the space complexity of selection sort?
Can we insert null in hashset?
Differentiate between file and structure storage structure.
Which interfaces are implemented by concurrentskiplistset?
What is data type in data structure?
Write a program to insert an element and in the specific position in the array?
Can we add heterogeneous elements into treemap?
