1. 比较两棵树是否相同
双指针,一个指向树p,一个指向树q,每次比较两颗树是否相同,相同则遍历左子树和右子树
/**
* 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} p
* @param {TreeNode} q
* @return {boolean}
*/
var isSameTree = function(p, q) {
if(!p && !q) {
return true;
}
if(!q || !p) {
return false;
}
return p.val === q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
};
2. 判断一棵树是否是对称的
也可以通过双指针来解决,转化为上面的问题,初始化p和q都是root,唯一多的一步是要创建一个新的函数来维护左右子树的状态
/**
* 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) {
var test = (left, right) => {
if(!left && !right) {
return true;
}
if(!left || !right) {
return false;
}
return left.val === right.val && test(left.left, right.right) && test(left.right, right.left);
}
return test(root, root)
};