finding two most distant elements in a binary tree

Posted by attwad on Stack Overflow See other posts from Stack Overflow or by attwad
Published on 2010-03-15T10:44:07Z Indexed on 2010/03/15 10:59 UTC
Read the original article Hit count: 293

I am looking for an algorithm that could find the two most distant elements in a binary tree, not looking for any special language, just for the algorithm.

Thanks.

© Stack Overflow or respective owner

Related posts about language-agnostic

Related posts about algorithm