Why Mirror a Binary Tree in DSA C++?

The Big Idea

What if you could flip a whole tree upside down with just a few lines of code?

The Scenario

Imagine you have a family tree drawn on paper, and you want to see its reflection as if looking in a mirror. Doing this by hand means redrawing every branch and leaf on the opposite side, which is tiring and easy to mess up.

The Problem

Manually swapping every left and right branch is slow and error-prone. You might forget some branches or place them incorrectly, making the mirrored tree wrong and confusing.

The Solution

Mirroring a binary tree with code swaps the left and right children of every node automatically. This simple process repeats down the tree, giving a perfect mirror image quickly and without mistakes.

Before vs After

✗ Before

void mirrorTree(Node* root) {
  // Manually swap left and right for each node
  if (root == nullptr) return;
  Node* temp = root->left;
  root->left = root->right;
  root->right = temp;
  mirrorTree(root->left);
  mirrorTree(root->right);
}

✓ After

void mirrorTree(Node* root) {
  if (!root) return;
  std::swap(root->left, root->right);
  mirrorTree(root->left);
  mirrorTree(root->right);
}

What It Enables

This lets you quickly create a mirrored version of any tree, useful in graphics, data transformations, and problem solving.

Real Life Example

In photo editing apps, flipping an image horizontally is like mirroring a tree structure of pixels, making the picture look reversed instantly.

Key Takeaways

Manual mirroring is slow and error-prone.

Code swaps left and right children recursively for a perfect mirror.

Useful in many computer graphics and data tasks.