Why Left Side View of Binary Tree in DSA Javascript?

The Big Idea

Discover how to see the hidden outline of a tree with just one simple view!

The Scenario

Imagine you have a tall tree in your backyard, and you want to see which branches are visible if you stand on the left side. If you try to list these branches by looking at every branch from the top, it can get confusing and hard to keep track.

The Problem

Manually checking each branch from the left side means you might miss some branches hidden behind others. It takes a lot of time and you can easily make mistakes by forgetting which branch is visible at each level.

The Solution

The Left Side View of a Binary Tree helps you quickly find all the branches visible from the left side by looking at the tree level by level and picking the first branch you see at each level. This way, you get a clear and simple list without missing anything.

Before vs After

✗ Before

function leftSideView(root) {
  // Manually check each node and guess visibility
  // No clear method, lots of confusion
}

✓ After

function leftSideView(root) {
  if (!root) return [];
  let result = [];
  let queue = [root];
  while(queue.length) {
    let levelSize = queue.length;
    for(let i = 0; i < levelSize; i++) {
      let node = queue.shift();
      if(i === 0) result.push(node.val);
      if(node.left) queue.push(node.left);
      if(node.right) queue.push(node.right);
    }
  }
  return result;
}

What It Enables

This concept lets you easily see the outline of a tree from the left side, helping in visualizing and understanding tree structures clearly.

Real Life Example

Think of a family tree where you want to see the oldest ancestor visible from the left side at each generation level. The Left Side View helps you list those ancestors quickly.

Key Takeaways

Manually finding visible nodes from the left is confusing and error-prone.

Left Side View picks the first node at each level for a clear outline.

This method simplifies understanding and visualizing tree structures.