Is there any way to find the most distant node for every node in binary tree. I know about problem of diemeter of the tree, but that is query about every node. I would like to have algorithm working in `O(nlogn)` for n-node tree.