树形数据根据id递归找到其上一级父节点id

Question

这样通过子节点childNodes的parentNode.roleId查找到上一级父节点的parentNode.roleId

"data": [
    {
      "parentNode": {
        "roleId": "6694658907350618112",
        "roleName": "运营者",
        "version": 4,
        "description": "2"
      },
      "childNodes": [
        {
          "parentNode": {
            "roleId": "6694660587689463808",
            "roleName": "测试",
            "version": 2,
            "description": "测试"
          },
          "childNodes": [
            {
              "parentNode": {
                "roleId": "6694967606510211072",
                "roleName": "3级",
                "version": 2,
                "description": "1"
              },
              "childNodes": null
            }
          ]
        },
        {
          "parentNode": {
            "roleId": "6694683686438817792",
            "roleName": "测试2",
            "version": 2,
            "description": "22"
          },
          "childNodes": null
        }
      ]
    },
    {
      "parentNode": {
        "roleId": "6694659210372304896",
        "roleName": "2",
        "version": 2,
        "description": "1"
      },
      "childNodes": [
        {
          "parentNode": {
            "roleId": "6694698250375122944",
            "roleName": "测试3",
            "version": 2,
            "description": "1"
          },
          "childNodes": null
        }
      ]
    }
  ],

Answer 1

JS树结构操作:查找、遍历、筛选、树结构和列表结构相互转换: https://wintc.top/article/20