101. 对称二叉树

解题思路：

判断一棵树是否对称，主要看三个地方。

① 对于根结点，要求左右两个子结点的值要相同

② 左结点的左子结点的值要等于右结点的右子结点的值

③ 左结点的右子结点的值要等于右结点的左子节点的值。

	public boolean isSymmetric(TreeNode root) {
		if (root == null)
			return true;
		return solve(root.left, root.right);
	}
	
	boolean solve(TreeNode left, TreeNode right) {
		if (left == null && right == null) {
			return true;
		} else if (left == null || right == null) {
			return false;
		}
		
		boolean condition1 = left.val == right.val;
		boolean condition2 = solve(left.left, right.right);
		boolean condition3 = solve(left.right, right.left);
		
		return condition1 && condition2 && condition3;
	}