js 平行上下级关系的数据转换成树形结构算法

const list = [
  {"id":6,"departmentId":1,"name":"a","name_en":null,"parentid":0,"order":65535,},
  {"id":7,"departmentId":2,"name":"b","name_en":null,"parentid":1,"order":65535,"isDelete":0},
  {"id":8,"departmentId":4,"name":"c","name_en":null,"parentid":1,"order":65535,"isDelete":0},
  {"id":9,"departmentId":5,"name":"d","name_en":null,"parentid":2,"order":65535,"isDelete":0}]

class Tree {
  constructor(formate ={}) {
    this.formate = formate;
  }
  /**
     * 树状的算法
     * @params list     代转化数组
     * @params parentId 起始节点
     */
  getTrees(list, parentId) {
    let items= {};
    // 获取每个节点的直属子节点，*记住是直属，不是所有子节点
    for (let i = 0; i < list.length; i