Grokking Tree Coding Patterns for Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Mirror Image Trees (medium)
On this page

Problem Statement

Examples

Try it yourself

Problem Statement

Given two binary trees root and root2, return true if they are mirror images of each other. Otherwise, return false.

Two trees are said to be mirror images if, for every node in one tree, there is a corresponding node in the other tree with a mirrored structure. This means the left subtree of one tree is a mirror reflection of the right subtree of the other tree, and vice versa.

Examples

Example 1

  • Input: root1 = [1,2,3,4,null,null,5], root2 = [1,3,2,5,null,null,4]
Image
  • Expected Output: true
  • Justification: Both trees have the same root, and the left and right subtrees are mirrors of each other.

Example 2

  • Input: root1 = [4, 5, 6, null, 7], root2 = [4, 6, 5, null, null, 7]
Image
  • Expected Output: true
  • Justification: Both trees are a mirror of each other.

Example 3

  • Input: root1 = [1, 2, null, 3], root2 = [1, null, 2]
Image
  • Expected Output: false
  • Justification: The structure of the subtrees differs. The first tree contains node 3 but the second tree doesn't.

Try it yourself

Try solving this question here:

Python3
Python3
. . . .

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page

Problem Statement

Examples

Try it yourself