We start with a binary tree and our goal is to find its top view.
The top view consists of nodes visible from the top, meaning for each horizontal distance, we take the first node encountered in level-order traversal.