Problem Statement
Given the root of a binary tree, return the nodes visible when the tree is viewed from the top.
For every horizontal distance (HD), only the first node encountered should be included.
Brute Force Intuition
In an interview, you can explain it like this:










