递归
还是一看这道题与上一道题,相同的树一样,使用递归来做。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
//创建一个函数判断两个节点是否为镜像
public boolean mirror(TreeNode L1,TreeNode L2){
if(L1 ==null && L2 == null){
return true;
}
if(L1 == null || L2 == null){
return false;
}
return (L1.val == L2.val)
&& mirror(L1.right,L2.left)
&& mirror(L1.left,L2.right);
}
public boolean isSymmetric(TreeNode root) {
return mirror(root,root);
}
}