terminal
Elevo
code
Topics
corporate_fare
Companies
history
History
arrow_back Back to Challenges

#101 Symmetric Tree

Easy Acceptance 0%
Editorial
description

Problem Description

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

checklist Constraints

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

science Examples

Case #1

In: root = [1,2,2,3,4,4,3]
Out: true

Case #2

In: root = [1,2,2,null,3,null,3]
Out: false

Mastery Tags

Recursion Trees

Hiring Companies

Amazon Bloomberg Microsoft
code

Integrated IDE

Login to Compile
code_blocks
Coding
psychology
Aptitude