Left View of a Binary Tree Problem Statement

Given a binary tree, your task is to print the left view of the tree.

Example:

Input:

The input will be in level order form, with node values separated by a space. Use -1 to denote null nodes.

Output:

The Left View of the tree.

Explanation:

Consider the following tree structure:
Level 1: Root = 1
Level 2: Left = 2, Right = 3
Level 3: Left = 4 (of 2), Right = 5 (of 3), Right = 6 (of 3)
Level 4: Right = 7 (of 4)
The Left View of this tree is: 1 2 4 7

Constraints:

0

Question

Left View of a Binary Tree Problem Statement

Given a binary tree, your task is to print the left view of the tree.

Example:

Input:

The input will be in level order form, with node values separated by a space. Use -1 to denote null nodes.

Output:

The Left View of the tree.

Explanation:

Consider the following tree structure:
Level 1: Root = 1
Level 2: Left = 2, Right = 3
Level 3: Left = 4 (of 2), Right = 5 (of 3), Right = 6 (of 3)
Level 4: Right = 7 (of 4)
The Left View of this tree is: 1 2 4 7

Constraints:

0 <= N <= 10⁵
1 <= data <= 10⁵
Time limit: 1 second

Accepted Answer

Print the left view of a binary tree given in level order form.

Traverse the tree level by level and print the first node of each level (leftmost node).
Use a queue to keep track of nodes at each level.
Update the left view array whenever a new level is encountered.

Asked in Delhivery

Left View of a Binary Tree Problem Statement

Example:

Input:

Output:

Explanation:

Constraints:

Top Software Developer Intern Interview Questions Asked at Delhivery

Interview Questions Asked to Software Developer Intern at Other Companies

Top Skill-Based Questions for Delhivery Software Developer Intern