JS 树（数组存储）进行递归遍历获取路径

const getPathByKey = (curKey, data) => {
  let result = []; // 记录路径结果
  let traverse = (curKey, path, data) => {
    if (data.length === 0) {
      return;
    }
    for (let item of data) {
      path.push(item);
      if (item.id === curKey) {
        result = JSON.parse(JSON.stringify(path));
        return;
      }
      const children = Array.isArray(item.children) ? item.children : [];
      traverse(curKey, path, children); // 遍历
      path.pop(); // 回溯
    }
  }
  traverse(curKey, [], data);
  return result;
}

const data = [
  {
    code: "090",
    id: "090",
    children: [
      {
        code: "0901",
        id: "0901",
        children: [
          {
            code: "090101",
            id: "090101",
          },
          {
            code: "090202",
            id: "090202",
          },
        ]
      },
      {
        code: "0902",
        id: "0902",
      },
    ]
  },
  {
    code: "091",
    id: "091",
    children: [],
  },
  {
    code: "092",
    id: "092",
    children: [
      {
        code: "0921",
        id: "0921",
      },
      {
        code: "0922",
        id: "0922",
        children: [
          {
            code: "092201",
            id: "092201",
            children: [
              {
                code: "09220101",
                id: "09220101",
              },
            ]
          },
        ]
      },
    ]
  },
];

// ...

getPathByKey('09220101', data);