What does it mean that B-tree leaves carry no information?
So according to CLRS (quotations):

Any &quot;satellite information&quot; associated with a key is stored in the same node as the key
Leaf nodes have no children, so their ci fields [pointers to child nodes, added for clarification] are undefined
A common variant on a B-tree, known as a B+-tree, stores all the satellite information in the leaves and stores only keys and child pointers in the internal nodes

There was no mention about leaf nodes carrying no keys/information/etc...
So basically leaf nodes do carry keys in order to actually get the data you search for (just like all the other nodes), they just don't carry pointers to child nodes.
And why Donald Knuth wrote (according to Wikipedia and other sources) that leaf nodes &quot;carry no information&quot; is beyond me, maybe he was referring to a different variant of B-tree... I honestly don't know.