LeetCode 101. Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        /**
         * 判断是否对称的树
         * 首先对根节点的两个子节点进行判断
         * 接下来就是递归过程
         */
        return root == null || isSymmetricHelp(root.left, root.right);
    }

    private boolean isSymmetricHelp(TreeNode left, TreeNode right) {
        /**
         * 递归过程
         * 对称的条件为：当前节点的左子树等于兄弟节点的右子树，当前节点的右子树等于兄弟节点的兄弟节点的左子树
         * 递归边界：找到不同or走到叶子节点
         */
        if (left == null || right == null) {
            return left == right;
        }

        if (left.val != right.val) {
            return false;
        } else {
            return isSymmetricHelp(left.right, right.left) && isSymmetricHelp(left.left, right.right);
        }

    }
}