Intermediate
Data Structures & Algorithms
Q52 / 100
What is the difference between a B-tree and a B+ tree?
Correct! Well done.
Incorrect.
The correct answer is B) B+ trees store data only in leaves (linked for sequential access); B-trees store data in all nodes
B
Correct Answer
B+ trees store data only in leaves (linked for sequential access); B-trees store data in all nodes
Explanation
B+ trees keep all keys in leaves with leaf-level linked list, optimizing range queries. B-trees store data in all nodes. Both maintain O(log n) operations. B+ trees are used in databases.
Progress
52/100