0101. Symmetric Tree
https://leetcode.com/problems/symmetric-tree
Description
Given the root
of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
Example 1:
Example 2:
Constraints:
The number of nodes in the tree is in the range
[1, 1000]
.-100 <= Node.val <= 100
Follow up: Could you solve it both recursively and iteratively?
ac
Last updated