##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Is it a mirror of itself?
Given the root of a binary tree, check whether it is a mirror of itself (symmetric around its center). Example: is symmetric. is not.
This problem combines ideas from "same tree" and "invert tree." A tree is symmetric if its left subtree is a mirror of its right subtree. Constraints: up to nodes, values from to .
