Right View of Binary Tree Python

PROGRAM TO PRINT RIGHT VIEW OF A BINARY TREE

class Node:

    # A constructor to create a new Binary tree Node

    def __init__(self, item):

        self.data = item

        self.left = None

        self.right = None

      

# Recursive function to print right view of Binary Tree

# used max_level as reference list ..only max_level[0] 

# is helpful to us

def rightViewUtil(root, level, max_level):

      

    # Base Case

    if root is None:

        return

      

    # If this is the last node of its level

    if (max_level[0] < level):

        print "%d   " %(root.data),

        max_level[0] = level

  

    # Recur for right subtree first, then left subtree

    rightViewUtil(root.right, level+1, max_level)

    rightViewUtil(root.left, level+1, max_level)

  

def rightView(root):

    max_level = [0]

    rightViewUtil(root, 1, max_level)

  

  

# Driver program to test above function

root = Node(1)

root.left = Node(2)

root.right = Node(3)

root.left.left = Node(4)

root.left.right = Node(5)

root.right.left = Node(6)

root.right.right = Node(7)

root.right.left.right = Node(8)

  

rightView(root)




OUTPUT:

1      3      7     8 

CREDITS: https://www.geeksforgeeks.org/print-right-view-binary-tree-2/