I mean I've waded through tons of code where the original author abused strings to indicate relationships in a table - a column with semicolon-separated values referencing other tables / rows. And a ton of code to check references.
Mind you, that's more database design than data structures, but they're close enough for this example.
I always attributed it to Rob Pike, but it turns out Pike's is following:
> Rule 4. Fancy algorithms are buggier than simple ones, and they're much harder to implement. Use simple algorithms as well as simple data structures.
> Rule 5. Data dominates. If you've chosen the right data structures and organized things well, the algorithms will almost always be self-evident. Data structures, not algorithms, are central to programming.
https://users.ece.utexas.edu/~adnan/pike.html
Interestingly enough, the above link has this to say:
> Rule 5 was previously stated by Fred Brooks in The Mythical Man-Month.
Which I guess references GP's excerpt.
Also says this, which kinda loops back to Linus's way of saying it:
> Rule 5 is often shortened to "write stupid code that uses smart objects".