Why Check if Two Trees are Symmetric in DSA C#?

The Big Idea

What if you could instantly tell if two complex trees are perfect mirror images without lifting a finger?

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. You try to compare each branch and leaf by looking back and forth manually.

The Problem

Manually checking each branch and leaf is slow and confusing. You might miss small differences or get tired, leading to mistakes. It's hard to keep track of which parts you already compared.

The Solution

Using a program to check if two trees are symmetric saves time and avoids errors. The program can compare branches step-by-step automatically, making sure every part matches perfectly as a mirror image.

Before vs After

✗ Before

bool AreSymmetric(TreeNode root1, TreeNode root2) {
  // Manually compare nodes one by one
  // Complex and error-prone
  return false; // placeholder
}

✓ After

bool AreSymmetric(TreeNode root1, TreeNode root2) {
  if (root1 == null && root2 == null) return true;
  if (root1 == null || root2 == null) return false;
  return root1.val == root2.val &&
         AreSymmetric(root1.left, root2.right) &&
         AreSymmetric(root1.right, root2.left);
}

What It Enables

This lets you quickly and reliably check if two trees are mirror images, enabling better data validation and tree-based problem solving.

Real Life Example

In graphics or UI design, checking if two layouts or structures are symmetric helps create balanced and visually pleasing designs automatically.

Key Takeaways

Manual comparison of trees is slow and error-prone.

Recursive checking automates and simplifies symmetry verification.

Symmetry checks help in many fields like design, data validation, and algorithms.

Practice

1. What does it mean for two binary trees to be symmetric?

easy

A. They have the same number of nodes.

B. They have the same root value only.

C. They are mirror images of each other around their center.

D. They have identical left subtrees only.

Solution

1. Step 1: Understand symmetry in trees

   Two trees are symmetric if one is the mirror reflection of the other around the center.

2. Step 2: Compare structure and node values

   Both structure and node values must match in a mirrored way for symmetry.

3. Final Answer:

   They are mirror images of each other around their center. -> Option C

4. Quick Check:

   Symmetry means mirror image [OK]

Hint: Symmetric trees mirror each other exactly [OK]

Common Mistakes:

• Thinking symmetry means identical trees
• Only comparing root values
• Ignoring structure in comparison

2. Which of the following C# method signatures correctly represents a function to check if two trees are symmetric?

easy

A. public void IsSymmetric(TreeNode root1, TreeNode root2)

B. public int IsSymmetric(TreeNode root1, TreeNode root2)

C. public string IsSymmetric(TreeNode root1, TreeNode root2)

D. public bool IsSymmetric(TreeNode root1, TreeNode root2)

Solution

1. Step 1: Determine return type for symmetry check

   The function should return true or false, so return type must be bool.

2. Step 2: Check method signature correctness

   Method with signature public bool IsSymmetric(TreeNode root1, TreeNode root2) matches expected usage.

3. Final Answer:

   public bool IsSymmetric(TreeNode root1, TreeNode root2) -> Option D

4. Quick Check:

   Return type bool for true/false [OK]

Hint: Symmetry check returns true or false, so use bool [OK]

Common Mistakes:

• Using void return type
• Returning int or string instead of bool
• Incorrect parameter types

3. What will be the output of the following C# code snippet?

class TreeNode {
  public int val;
  public TreeNode left, right;
  public TreeNode(int x) { val = x; }
}

bool IsMirror(TreeNode t1, TreeNode t2) {
  if (t1 == null && t2 == null) return true;
  if (t1 == null || t2 == null) return false;
  return (t1.val == t2.val) && IsMirror(t1.left, t2.right) && IsMirror(t1.right, t2.left);
}

TreeNode root1 = new TreeNode(1);
root1.left = new TreeNode(2);
root1.right = new TreeNode(3);

TreeNode root2 = new TreeNode(1);
root2.left = new TreeNode(3);
root2.right = new TreeNode(2);

Console.WriteLine(IsMirror(root1, root2));

medium

A. True

B. False

C. Compilation error

D. Runtime exception

Solution

1. Step 1: Analyze tree structures

   root1 has left=2, right=3; root2 has left=3, right=2, which are mirror images.

2. Step 2: Trace IsMirror function calls

   IsMirror compares root values (1==1), then left of root1 with right of root2 (2==2), and right of root1 with left of root2 (3==3), all true.

3. Final Answer:

   True -> Option A

4. Quick Check:

   Mirror check returns true [OK]

Hint: Mirror check compares opposite children recursively [OK]

Common Mistakes:

• Confusing left and right children
• Assuming identical structure means symmetric
• Ignoring null checks

4. Identify the bug in the following C# method that checks if two trees are symmetric:

bool IsMirror(TreeNode t1, TreeNode t2) {
  if (t1 == null || t2 == null) return true;
  if (t1.val != t2.val) return false;
  return IsMirror(t1.left, t2.right) && IsMirror(t1.right, t2.left);
}

medium

A. The first if condition should return false if one node is null and the other is not.

B. The method should return void instead of bool.

C. The comparison t1.val != t2.val is incorrect and should be reversed.

D. The recursive calls should compare t1.left with t2.left and t1.right with t2.right.

Solution

1. Step 1: Check null node handling

   If one node is null and the other is not, trees are not symmetric, so should return false, not true.

2. Step 2: Verify other conditions

   Value comparison and recursive calls are correct for mirror checking.

3. Final Answer:

   The first if condition should return false if one node is null and the other is not. -> Option A

4. Quick Check:

   Null mismatch means false [OK]

Hint: Return false if only one node is null [OK]

Common Mistakes:

• Returning true when one node is null
• Mixing up recursive child comparisons
• Incorrect return types

5. Given two binary trees, write a method to check if they are symmetric around their center. Which approach below correctly solves this problem efficiently?

hard

A. Use a queue to perform level order traversal and compare nodes at each level from left to right.

B. Use a recursive helper that compares left subtree of first tree with right subtree of second tree and vice versa.

C. Check if both trees have the same number of nodes and same root value only.

D. Traverse both trees in preorder and compare the traversal lists for equality.

Solution

1. Step 1: Understand symmetry check logic

   Symmetry means left subtree of one tree matches right subtree of the other and vice versa.

2. Step 2: Evaluate approaches

   Recursive helper comparing opposite subtrees is efficient and correct. Preorder or level order traversals do not capture mirror structure properly.

3. Final Answer:

   Use a recursive helper that compares left subtree of first tree with right subtree of second tree and vice versa. -> Option B

4. Quick Check:

   Mirror recursion solves symmetry [OK]

Hint: Compare opposite subtrees recursively for symmetry [OK]

Common Mistakes:

• Comparing same side subtrees instead of opposite
• Using traversal equality which misses mirror structure
• Ignoring node values in comparison