LeetCode — Symmetric tree

Problem statement Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Problem statement taken from: https://leetcode.com/problems/symmetric-tree Example 1: Input: root = [1, 2, 2, 3, 4, 4, 3] ...