right view python

# http://code2begin.blogspot.com
# Program to print right view of the binary tree
# node class
class node:
    def __init__(self, element):
        self.data = element
        self.left = None
        self.right = None


# function to print the left view of the binary tree
def right_view(Node):
    def right_view_helper(Node, level=0):
        if Node is None:
            return

        if right_view_helper.max_level < level:
            right_view_helper.max_level = level
            print(Node.data, end=" ")

        right_view_helper(Node.right, level + 1)
        right_view_helper(Node.left, level + 1)

    right_view_helper.max_level = -1
    right_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("Right view of the binary tree is : ")
right_view(head)