Skip to content

Latest commit

 

History

History
12 lines (9 loc) · 354 Bytes

File metadata and controls

12 lines (9 loc) · 354 Bytes

Problem 5: Reflection Check

Problem Statement

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Input Format

  • The root of a binary tree.

Example

Input: root = [1, 2, 2, 3, 4, 4, 3]
Output: True Explanation: The left and right subtrees are mirrors of each other.