Left View of a Binary Tree

A binary tree's left view is obtained by performing a level-order traversal (BFS) and recording the first node encountered at each level. This approach has a time complexity of O(N) and space complexity of O(N). To implement this, use a queue to process nodes level by level, and add the first node at each level to the result.