LeetCode--101--easy--SymmetricTree

package com.app.main.LeetCode.tree;

import com.app.main.LeetCode.base.TreeNode;

/**
 * 101
 *
 * easy
 *
 * https://leetcode.com/problems/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:
 *
 *     1
 *    / \
 *   2   2
 *  / \ / \
 * 3  4 4  3
 *
 * *     1
 *  *    / \
 *  *   2   2
 *  *  / \ / \
 *  * 3  4 4  3
 *
 *
 * But the following [1,2,2,null,3,null,3] is not:
 *
 *     1
 *    / \
 *   2   2
 *    \   \
 *    3    3
 *
 *
 * Note:
 * Bonus points if you could solve it both recursively and iteratively.
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/10/26
 * Time:下午11:02
 */
public class SymmetricTree {

    public boolean isSymmetric(TreeNode root) {
        return process(root, root);
    }

    private boolean process(TreeNode root1, TreeNode root2) {
        if (root1 == null && root2 == null) {
            return true;
        }

        if (root1 == null || root2 == null) {
            return false;
        }

        if (root1.val == root2.val) {
            if (process(root1.right, root2.left) && process(root1.left, root2.right)) {
                return true;
            }
        }
        return false;
    }
}