Right View of Binary Tree

// Java program to print right view of binary tree

// A binary tree node
class Node {

	int data;
	Node left, right;

	Node(int item)
	{
		data = item;
		left = right = null;
	}
}

// class to access maximum level by reference
class Max_level {

	int max_level;
}

class BinaryTree {

	Node root;
	Max_level max = new Max_level();

	// Recursive function to print right view of a binary
	// tree.
	void rightViewUtil(Node node, int level,
					Max_level max_level)
	{

		// Base Case
		if (node == null)
			return;

		// If this is the last Node of its level
		if (max_level.max_level < level) {
			System.out.print(node.data + " ");
			max_level.max_level = level;
		}

		// Recur for right subtree first, then left subtree
		rightViewUtil(node.right, level + 1, max_level);
		rightViewUtil(node.left, level + 1, max_level);
	}

	void rightView() { rightView(root); }

	// A wrapper over rightViewUtil()
	void rightView(Node node)
	{

		rightViewUtil(node, 1, max);
	}

	// Driver program to test the above functions
	public static void main(String args[])
	{
		BinaryTree tree = new BinaryTree();
		tree.root = new Node(1);
		tree.root.left = new Node(2);
		tree.root.right = new Node(3);
		tree.root.left.left = new Node(4);
		tree.root.left.right = new Node(5);
		tree.root.right.left = new Node(6);
		tree.root.right.right = new Node(7);
		tree.root.right.left.right = new Node(8);

		tree.rightView();
	}
}

// This code has been contributed by Mayank Jaiswal