Symmetric Tree
Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
isSymmetric(tree([1, 2, 2, 3, 4, 4, 3])); // true
isSymmetric(tree([1, 2, 2, null, 3, null, 3])); // falsewarmup12 min read
Symmetric Tree
Created byeLearn Core Team
Run your code to see results.
DeepFrontend Pro Challenge
Unlock All 130+ Coding Challenges
This interactive challenge requires a DeepFrontend Pro membership. Get instant access to write, execute, test, and view verified solution code directly in your browser.
✓130+ auto-graded coding challenges
✓Verified solution code & complexity
✓Unrestricted access to all 280+ topics
✓Senior/Staff interview questions & AI tutor
Regional pricing available • Instant access
Stuck? This challenge exercises: