Hacker News new | ask | show | jobs
by helge9210 1610 days ago
A sequence of checks to arrive at the root cause of the problem can be represented as a path in (preferably balanced) binary search tree. Binary search tree is not a goal by itself, but a tool to build a mental model for a practical problem solution.

So at least to me "this kind of things" would be a superset of "find a sum of polynomials" and checking knowledge of a subset is a little bit easier.

1 comments

> A sequence of checks to arrive at the root cause of the problem can be represented as a path in (preferably balanced) binary search tree.

Yes, probably everything in this world can be represented as a balanced binary search tree, who knows.