请实现一个函数,用来判断一棵二叉树是不是对称的。如果一棵二叉树和它的镜像一样,那么它是对称的。
思路:从顶至底递归,逐次比较每对节点是否相同.
/**
* 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) {
if (root == null){
return true;
}
return recur(root.left, root.right);
}
public boolean recur(TreeNode t1, TreeNode t2){
if (t1 == null && t2 == null){ //base case
return true;
}else if (t1 == null || t2 == null){
return false;
}else if (t1.val != t2.val){
return false;
}
return recur(t1.left, t2.right) && recur(t1.right, t2.left);
}
}