90. Symmetric Tree

EasyTree

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Examples

Input: [1,2,2,3,4,4,3]

Output: true

Explanation: The tree is symmetric around the root.

Constraints

  • The number of nodes in the tree is in the range [1, 1000].
  • -100 <= Node.val <= 100
Loading...

Run checks all cases above. Submit evaluates all test cases.