what is the different between B-tree and B+ tree.
- 8 Answers
- 42071 Views
- Syntel, I also Faced
- E-Mail Answers
Answer Posted / kamar rahi
In a B- tree you can store both keys and data in the
internal/leaf nodes. But in a B+ tree you have to store the
data in the leaf nodes only.
| Is This Answer Correct ? | 60 Yes | 6 No |
Post New Answer View All Answers
Which interface treemap implements?
What is bubble sort with example?
What is adt and its advantages?
What is complexity of quicksort?
List out a few of the applications that make use of Multilinked Structures?
Name few classes that implement collection interface?
What is the default size of arraylist?
Mention a few applications of linked lists?
What is the family trees and connection by clause?
Two linked lists are given, find out the sum of them without altering the linked list?
How do you find the height of a binary tree?
Do you know what is linear search?
Which sorting is worst?
Does array sort mutate?
Tell me about circular linked list?
