3 ms·
> Trees are the single most important data structure in computer science. And yet I've never professionally had to reverse one or know if they are symmetrical.
by wvenable 11y ago
> Trees are the single most important data structure in computer science.
And yet I've never professionally had to reverse one or know if they are symmetrical.
- eonw 11y agomy thoughts exactly, never had to do that once.
- nostrademons 11y agoI've had to recurse on a tree many, many times, though. Think of filesystems, DOM nodes, parse trees, control-flow graphs, nested annotations, tiered lookups, query builders, JSON structures, etc. That's what this question is actually testing: can you decompose a problem statement, expressed in plain English, into subproblems and then solve the subproblems?