← Questions
Symmetric tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given the root of a binary tree, return whether it is a mirror image of itself around its centre. Compare the left and right subtrees pairwise: outer children with outer children, inner with inner. Write it recursively, then iteratively with a queue.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding