Lstmxx的空间

872. 叶子相似的树

请考虑一棵二叉树上所有的叶子，这些叶子的值按从左到右的顺序排列形成一个 叶值序列 。

链接

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     val: number
 *     left: TreeNode | null
 *     right: TreeNode | null
 *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
 *         this.val = (val===undefined ? 0 : val)
 *         this.left = (left===undefined ? null : left)
 *         this.right = (right===undefined ? null : right)
 *     }
 * }
 */

function leafSimilar(root1: TreeNode | null, root2: TreeNode | null): boolean {
  const res1: number[] = []
  const res2: number[] = []
  function dfs(node: TreeNode | null, res: number[]){
    if (node === null) return
    if (node.left === null && node.right === null) {
      res.push(node.val)
    }
    dfs(node.left, res)
    dfs(node.right, res)
  }
  dfs(root1, res1)
  dfs(root2, res2)
  return res2.length === res1.length && res2.every((data, index) => data === res1[index])
};