Algorithms: Left view of a binary tree. To do this we do a level order traversal and keep on printing the first node of that level to get the left view.