JavaScript集合（Array）转树（tree）结构

/**

 * 将list装换成tree
 * @param {Object} myId 数据主键id
 * @param {Object} pId  数据关联的父级id
 * @param {Object} children 子节点的节点名称
 * @param {Object} paramList list数据集合
 */
function listToTree(myId, pId,children, paramList) {
  function recursion(id,pId,all,item){
    let childrenList=all.filter(ele=>ele[pId] === item[id]);
    if (childrenList&&childrenList.length>0){
      childrenList.forEach(function(f){
        recursion(id,pId,all,f);
      })
      let myChildrenList = item[children];
      if (myChildrenList === undefined){
          myChildrenList=[];
      }
      childrenList.forEach(o=>myChildrenList.push(o));
      item[children]=myChildrenList;
    }
  }

  if (!paramList||paramList.length===0){
    return [];
  }
  let list = JSON.parse(JSON.stringify(paramList));
  let parentList=list.filter(ele=>ele[pId] === null||ele[pId] === undefined);
  if (!parentList){
    return [];
  }
  parentList.forEach(function(it){
    recursion(myId,pId,list,it);
  })
  return  parentList;
}

	function dealData(){
		let treeData=listToTree('id','pid','subList',listData);
		console.log(treeData);
	}

js集合过滤 js集合转树 js集合filter

https://www.leftso.com/article/1050.html