print the left view of tree by using BFS:

class Node {

int key;

Node left, right;

public Node(int item) {

key = item;

left = right = null;

}

}

class Leftview

{

static void print(Node root)

{

if(root==null) return;

Queue<Node> q=new LinkedList<>();

q.add(root);

while(!q.isEmpty())

{

int size=q.size();

for(int i=0; i<size; i++)1<2

{

Node current=q.poll();

if(i==0)

System.out.println(current.data)

if (current.left != null) queue.add(current.left);

if (current.right != null) queue.add(current.right);

}

}

}

Leftview tree = new Leftview();

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.right.right = new Node(5);

System.out.print(“Left view: “);

tree.print(tree.root);}}