Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44516 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 arraylist contain duplicates?
How can you insert a node in a random location of the linked list?
Run time memory allocation is known as in data structure?
Is hashtable throw concurrentmodificationexception?
State the difference between primitive and non-primitive data types?
What is default array size?
Is linked list faster than array?
Write the postfix form of the expression: (a + b) * (c - d)
How do you sort a list in reverse order?
How memory is reserved using a declaration statement in data structure?
Which interfaces are implemented by hashmap?
How many null values are allowed in hashmap?
Write a program to reverse a link list.
Differentiate bfs and dfs?
What is advantage and disadvantage of linked list?
