剑指 Offer 28. 对称的二叉树
请实现一个函数,用来判断一棵二叉树是不是对称的。如果一棵二叉树和它的镜像一样,那么它是对称的。
例如,二叉树 [1,2,2,3,4,4,3] 是对称的。
1
/
2 2
/ \ /
3 4 4 3
但是下面这个 [1,2,2,null,3,null,3] 则不是镜像对称的:
1
/
2 2
\
3 3
示例 1:
输入:root = [1,2,2,3,4,4,3]
输出:true
示例 2:
输入:root = [1,2,2,null,3,null,3]
输出:false
限制:
0 <= 节点个数 <= 1000
解法一:左右比较
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
return root == null ? true : recur(root.left ,root.right);
}
public boolean recur(TreeNode L,TreeNode R){
if(R == null && L == null )
return true;
if(R == null || L == null || R.val != L.val)
return false;
return recur(L.left,R.right) && recur(L.right,R.left);
}
}
解法二:迭代 左右交换
/**
* 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) {
return recur(root,root);
}
public boolean recur(TreeNode p,TreeNode q){
Queue<TreeNode> qu = new LinkedList<>();
qu.offer(p);
qu.offer(q);
while(qu.size() > 0){
TreeNode u = qu.poll();
TreeNode v = qu.poll();
if (u == null && v == null)
continue;
if(u == null || v == null || u.val != v.val)
return false;
qu.offer(u.left);
qu.offer(v.right);
qu.offer(u.right);
qu.offer(v.left);
}
return true;
}
}
- 创建者:师晓峰
- 创建时间:2022/6/8 21:50