872 叶子相似的树

code

/**
 * 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} root1
 * @param {TreeNode} root2
 * @return {boolean}
 */
var leafSimilar = function(root1, root2) {
    let result1 = [];
    let result2 = [];
    function traverse(root, result){
        if(root === null){
            return;
        }
        if(root.left === null && root.right === null){
            result.push(root.val);
            return;
        }
        traverse(root.left, result);
        traverse(root.right, result);

    }
    traverse(root1, result1);
    traverse(root2, result2);
    if(result1.length === result2.length && result1.every(
        (item, id) => {
            return item === result2[id]
        }
    )){
        return true;
    } else {
        return false;
    }
};

总结

1. 好像也没啥...可能都是左序遍历的各种变体？