C# LeetCode 101: Symmetric Tree
Problem Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its centre). Approach To verify symmetry: Left subtree of the root must be a mirror of the right subtree. This means: Left child matches right child Left’s left matches right’s right Left’s right matches right’s left…