Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 874
How does a B+ tree differ from a B-tree?
A
B-trees have linked leaves
B
In a B+ tree all values live in leaves (internal nodes hold only keys) and leaves are linked; a B-tree stores values in internal nodes too
C
B+ trees are binary
D
They are identical