# http://code2begin.blogspot.com
# Program to print the left view of a given binary tree
# node class
class node:
def __init__(self, element):
self.data = element
self.left = None
self.right = None
def left_view(Node):
# function to print the left view of the binary tree
def left_view_helper(Node, level=0):
if Node is None:
return
if left_view.max_level < level:
left_view.max_level = level
print(Node.data, end=" ")
left_view_helper(Node.left, level + 1)
left_view_helper(Node.right, level + 1)
left_view.max_level = -1
left_view_helper(Node)
head = node(1)
head.left = node(2)
head.right = node(3)
head.left.left = node(4)
head.left.right = node(5)
head.right.right = node(6)
head.left.left.right = node(7)
head.right.right.left = node(8)
head.left.left.right.left = node(9)
head.left.left.right.left.left = node(10)
head.right.right.left.right = node(11)
print("Left view of the binary tree is : ")
left_view(head)