node.js 递归组织树状结构方法

最新推荐文章于 2024-08-09 16:28:14 发布

keepstudy_yangzh

最新推荐文章于 2024-08-09 16:28:14 发布

阅读量912

点赞数 3

分类专栏： node 文章标签： nodejs

本文链接：https://blog.csdn.net/qq_35997793/article/details/107486725

版权

node 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

js递归组织树状结构函数方法

function recursionDataTree(dataList,pid){
    let resultList = [];
    if (!dataList) return null; 
    for (const map of dataList) {
        let bmid_new = map["id"];
        let parentId = map["pid"];
        if (pid==parentId) {
            const data = map;
           let childrenList = this.recursionDataTree(dataList, bmid_new);
            if (childrenList)
            data["children"]= childrenList;
            resultList.push(data);
        }
    }
    return resultList;
  }

eg:

    let dltest=[{id:'1',pid:'0',name:'大类1'},{id:'2',pid:'0',name:'大类2'},{id:'3',pid:'0',name:'大类3'},{id:'4',pid:'1',name:"中类11"},{id:'5',pid:'1',name:"中类12"},{id:'6',pid:'4',name:"小类111"}];
    let resultdata=recursionDataTree(dltest,'0');

结构如下：

[{"id":"1","pid":"0","name":"大类1","children":[{"id":"4","pid":"1","name":"中类11","children":[{"id":"6","pid":"4","name":"小类111","children":[]}]},{"id":"5","pid":"1","name":"中类12","children":[]}]},{"id":"2","pid":"0","name":"大类2","children":[]},{"id":"3","pid":"0","name":"大类3","children":[]}]