Why Check if Two Trees are Symmetric in DSA Typescript?

The Big Idea

What if you could instantly tell if two complex trees are perfect mirror images without getting lost in details?

The Scenario

Imagine you have two family trees drawn on paper, and you want to see if one is a mirror image of the other. Doing this by looking at each branch and comparing them one by one can be confusing and tiring.

The Problem

Manually checking each branch and leaf for symmetry is slow and easy to mess up. You might miss a small difference or get lost in the details, especially if the trees are big.

The Solution

Using a simple method to compare the trees step-by-step automatically checks if they are mirror images. This saves time and avoids mistakes by following clear rules for symmetry.

Before vs After

✗ Before

function areSymmetricManual(tree1, tree2) {
  // Manually compare nodes one by one
  // Lots of repeated checks and confusion
}

✓ After

function areSymmetric(tree1, tree2) {
  if (!tree1 && !tree2) return true;
  if (!tree1 || !tree2) return false;
  return tree1.val === tree2.val &&
         areSymmetric(tree1.left, tree2.right) &&
         areSymmetric(tree1.right, tree2.left);
}

What It Enables

This lets you quickly and correctly find out if two trees are mirror images, no matter how big or complex they are.

Real Life Example

Checking if two family trees or organizational charts are symmetrical helps spot patterns or errors in data entry.

Key Takeaways

Manual comparison is slow and error-prone.

Recursive checking automates symmetry verification.

Enables fast, reliable mirror-image detection in trees.