Hacker News Reader

There are more than that, even finding diameter of a tree is pretty nasty

Only nasty to find diameter of general graphs, right? If you know you have a tree, just root it at a random vertex and recursively compute `max(largest diameter of children, sum of the two biggest heights of children)`

Ah yes, but I use Rust, I cannot go back up a tree (-:

No graphs either :(

Reply on news.ycombinator.com