1. 题目
2. 实现
2.1 思路
2.2 代码
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {boolean}
*/
var isSymmetric = function(root) {
if(root === null) {
return true;
}
// 递归查看左子树、右子树
return dfs(root.left, root.right);
};
// 递归判断是否为对称二叉树的方法
function dfs(left, right) {
if(left === null && right === null) {
return true;
}
// 递归终止条件
if(left === null || right === null) {
return false;
}
if(left.val !== right.val) {
return false;
}
return dfs(left.left, right.right) && dfs(left.right, right.left);
}