Symmetric Tree

Description:

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

Ex:

    1
   / \
  2   2
 / \ / \
3  4 4  3      ----symmetric

    1
   / \
  2   2
   \   \
   3    3      ---- not symmetric

问题描述

判断一颗二叉树是否为对称树（将二叉树以中间为轴线能左边和右边够折叠起来）

解法一：

思路：

先把空树的情况排除后，要讨论左右子树的对称问题。所以构造辅助函数–

private boolean isSymmetric(TreeNode left , TreeNode right)

用递归(DFS)的方式来判断

return isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);

这棵树的对称性。

Code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isSymmetric(TreeNode root) {
        return root == null || isSymmetric(root.left, root.right);
    }
    private boolean isSymmetric(TreeNode left , TreeNode right){
        //check one of the child tree is empty
        if(left== null || right == null){
            return left == right;
        }

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