DSA TrainerSymmetric Tree
Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
This is a premium problem.
Unlock Symmetric Tree with both full courses, DSA and System Design, and every other premium problem.
Problem
Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
Input
The root of a binary tree.
Output
`true` if the tree is symmetric, `false` otherwise.
Examples
Input: root = [1,2,2,3,4,4,3]
Output: true
The left subtree and right subtree are mirror images: left.val=2, right.val=2; left-left.val=3 mirrors right-right.val=3; left-right.val=4 mirrors right-left.val=4.
Input: root = [1,2,2,null,3,null,3]
Output: false
The right children of both level-2 nodes are 3, but a mirror requires them on opposite sides.
The brute-force approach
Collect the level-order traversal and check each level to see if it's a palindrome.
# BFS level by level, check each level is a palindrome
# Must include nulls to detect structural asymmetryO(n) time and O(n) space for the BFS queue — same complexity as the recursive approach, but more code and null tracking is tricky to get right.
Spotting the pattern
This is a Tree Traversal problem. The key question to ask yourself:
What does it mean for two subtrees to be mirrors of each other?
Answering that is where it clicks, and it's exactly what the guided walkthrough below builds with you: the pattern reasoning, a progressive hint ladder that never spoils the answer, a row-by-row dry run, the optimized solution, and an in-browser editor to run your code against real test cases.
Unlock the full guided solution
The Tree Traversal walkthrough for Symmetric Tree: the progressive hint ladder, a row-by-row dry run, the optimized code, and an in-browser runner, plus both full courses, DSA and System Design, and every other premium problem.
Already finished Big-O and Hash Maps free? This picks up right where the path leads: same format, harder patterns, the ones that show up in every FAANG-style screen.
What you get
- ✓The full DSA course: concept lessons, drills, graded tests, and cold-read capstones for every pattern
- ✓The full System Design course: 20 building-block units for the design round, included at no extra cost
- ✓Stop going blank on algorithm problems. The hint ladder walks you to the answer without spoiling it.
- ✓Actually internalize the trace: dry runs walk state row by row so it clicks before you write a line
- ✓Know when to reach for each pattern. Every problem names the trigger so you spot it next time.
- ✓Write and run JS or Python in the browser with real test cases on every problem
- ✓Access every new problem, unit, and pattern guide as they ship weekly
“This app finally made it click. I tried NeetCode, CTCI, and YouTube for years and still couldn't solve Two Sum. The beginner mental models for the patterns are genuinely so helpful. THANK YOU.”
Full access
$49 / year
or $9 / month
Now includes a C++ runner alongside JavaScript and Python.
LeetCode Premium is $159/year and doesn't teach you anything.
Less than one Udemy course, with guided problems instead of passive lectures.
One extra month of job searching costs more than a full year here.
- ✓Both courses, every unit: DSA + System Design
- ✓All 150 problems across 33 patterns, plus every new one
- ✓New problems and units weekly
- ✓Cancel anytime
Cancel anytime. Not useful within 7 days? Email for a full refund. Secured by Stripe.