Skip to content

Practice Symmetric Tree

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#101
LeetCode Problem

Symmetric Tree

Problem Statement

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

Source: Symmetric Tree on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
root = [1,2,2,3,4,4,3]
Output
true

# Example 2

Input
root = [1,2,2,null,3,null,3]
Output
false

Constraints

The number of nodes in the tree is in the range [1, 1000].
-100 <= Node.val <= 100

Related LeetCode Problems

Practice more problems similar to Symmetric Tree.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.