Even better than that: a literal traveling salesman problem! At least building a binary search tree is O(n.log(n))... what they were solving is NP hard (for th

Even better than that: a literal traveling salesman problem! At least building a binary search tree is O(n.log(n))... what they were solving is NP hard (for the optimal solution).