题目描述:
请实现一个函数,用来判断一棵二叉树是不是对称的。如果一棵二叉树和它的镜像一样,那么它是对称的。
例如,二叉树 [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
题解:
1.解题思路:递归
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @return {boolean}
*/
var isSymmetric = function(root) {
return root == null ? true : recur(root.left, root.right);
function recur(l, r) {
if (l == null && r == null) return true;
if (l == null || r == null || l.val != r.val) return false;
return recur(l.left, r.right) && recur(l.right, r.left);
}
};
2.解题思路:迭代+队列
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @return {boolean}
*/
var isSymmetric = function(root) {
if(root == null) return true;
const queue = [];
queue.push(root.left);
queue.push(root.right);
while(queue.length>0){
const leftNode = queue.shift()
const rightNode = queue.shift()
if(leftNode==null&&rightNode==null){
continue
}
if(leftNode==null||rightNode==null||(leftNode.val!=rightNode.val)){
return false
}
queue.push(leftNode.left)
queue.push(rightNode.right)
queue.push(leftNode.right)
queue.push(rightNode.left)
}
return true
};