LeetCode101----对称二叉树

public class LeetCode101 {
	public boolean isSymmetric = true;

	public static class TreeNode {
		int val;
		TreeNode left;
		TreeNode right;

		TreeNode(int x) {
			val = x;
		}
	}

	public boolean isSymmetric(TreeNode root) {
		if (root == null) {
			return true;
		}
		isSymmetric(root.left, root.right);
		return isSymmetric;
	}

	public void isSymmetric(TreeNode left, TreeNode right) {
		if (left == null || right == null) {
			if (left != right) {
				isSymmetric = false;
			}
			return;
		}
		isSymmetric(left.left, right.right);
		isSymmetric(left.right, right.left);
		if (left != null && right != null) {
			if (left.val != right.val) {
				isSymmetric = false;
			}
		}
	}
}