Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44542 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
How memory is reserved using a declaration statement in data structure?
How to cut or remove an element from the array?
Can we increase the size of statically allocated array?
We know that Arrays are objects so why cannot we write strArray.length()?
Which is the slowest sorting algorithm?
Differentiate linear from non linear data structure?
Explain set interface?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
Can we add duplicate keys in a hashmap?
What is difference between list and linked list?
Describe stack operation.
Differentiate between queue and stack.
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
What are the advantages of binary search over linear search?
What are the disadvantages of linked list over array?
