Find the farthest leaf from each node in a binary tree. The expected runtime complexity is O(N).