JS 递归将数组转为树形结构

 originTree(data) {
      // 递归方法
        var result = []
        for (const param of data) {
        if (param.parentId === 435) {  // 判断是否为顶层节点
          var parent = {
            'id': param.menuCode,
            'label': param.menuName
          }
          parent.children = this.getchilds(param.menuCode, data)  // 获取子节点
          result.push(parent)
        }
      }
      return result

    },
    getchilds(menuCode, array) {
      const childs = []
      for (const arr of array) {  // 循环获取子节点
        if (arr.parentId === menuCode) {
          childs.push({
            'id': arr.menuCode,
            'label': arr.menuName
          })
        }
      }
      for (const child of childs) { // 获取子节点的子节点
        const childscopy = this.getchilds(child.id, array)// 递归获取子节点
        if (childscopy.length > 0) {
          child.children = childscopy
        }
      }
      return childs
    },`