# Print Left View of a given binary tree

Objec­tive: In a Binary Tree, print left view of it

Input: A binary tree.

What is left View of a binary Tree

When just look at the tree from the left side , all the nodes you can see will be the left view of the tree.

Exam­ple:

Left View of a binary tree

Approach:

Method 1:

• Tra­verse the tree from left to right
• Print the first node you encounter
• Take two vari­ables , currentLevel=0 and nextLevel=1
• As soon as you change level , change the cur­rentLevel = nextLevel
• Print only when cur­rent level<nextLevel so this way you will print only the first element
• For rest of the nodes on the the level cur­rentLevel and nextLevel are equal so it wont print

Method 2:

Do the Level order tra­ver­sal and print the first node value

Com­plete Code:

Out­put:

```METHOD 1:
5 10 20 45
METHOD 2 : Using Level Order, Left view
5 10 20 45
```

#### You may also like...

• Pintu Das

Please check the height(Node root) method. I think the base case (root == null) should return –1 instead of 0;