Left and right views of a binary tree

Return the left view of a binary tree (the first node seen at each level from the left) and the right view (the last node at each level). Write it with breadth-first search, then with depth-first search, and dry-run both on an example.