用递归的方式实现数组转树

最新推荐文章于 2023-01-04 15:58:37 发布

喜欢读书的三金

最新推荐文章于 2023-01-04 15:58:37 发布

阅读量223

点赞数 2

分类专栏： JavaScript 文章标签： javascript 开发语言 ecmascript

本文链接：https://blog.csdn.net/weixin_46185369/article/details/120982128

版权

JavaScript 专栏收录该内容

16 篇文章 2 订阅

订阅专栏

用递归的方式实现数组转树

<script>

  /**
  * 把平铺的数组结构转成树形结构
  */
  const arr = [
  {id:"01", name: "张大大", pid:"", job: "项目经理"},
  {id:"02", name: "小亮", pid:"01", job: "产品leader"},
  {id:"03", name: "小美", pid:"01", job: "UIleader"},
  {id:"04", name: "老马", pid:"01", job: "技术leader"},
  {id:"05", name: "老王", pid:"01", job: "测试leader"},
  {id:"06", name: "老李", pid:"01", job: "运维leader"},
  {id:"07", name: "小丽", pid:"02", job: "产品经理"},
  {id:"08", name: "大光", pid:"02", job: "产品经理"},
  {id:"09", name: "小高", pid:"03", job: "UI设计师"},
  {id:"10", name: "小刘", pid:"04", job: "前端工程师"},
  {id:"11", name: "小华", pid:"04", job: "后端工程师"},
  {id:"12", name: "小李", pid:"04", job: "后端工程师"},
  {id:"13", name: "小赵", pid:"05", job: "测试工程师"},
  {id:"14", name: "小强", pid:"05", job: "测试工程师"},
  {id:"15", name: "小涛", pid:"06", job: "运维工程师"}
]

// * 数组转树  递归求解
//  */
function toTree(list,pid = ''){
  let treeList = []
  treeList = list.filter(item => {
   return item.pid === pid
  })
	list.forEach(item=>{
		treeList.children=toTree(list,item.id)
	})
	return treeList
}

let result = toTree(arr)
console.log(result);

</script>