js将列表遍历成树形结构

        //递归方法 生成 json tree 数据
        getJsonTree(data, pid) {
            var result = [], temp;
            for (var i = 0; i < data.length; i++) {
                if (data[i].pid == pid) {
                    var obj = {"title": data[i].title,"id": data[i].id};
                    temp = this.getJsonTree(data, data[i].id);
                    if (temp.length > 0) {
                        obj.children = temp;
                    }
                    result.push(obj);
                }
            }
            return result;
        }
        let treeList = [
            {"id":1,"title":"语文","pid":0},
            {"id":2,"title":"数学","pid":0},
            {"id":3,"title":"英语","pid":0},
            {"id":4,"title":"阅读","pid":1},
            {"id":5,"title":"作文","pid":1},
            {"id":6,"title":"算数","pid":2},
            {"id":7,"title":"应用","pid":2},
            {"id":8,"title":"单词","pid":3},
            {"id":9,"title":"语句","pid":3},
            {"id":10,"title":"为什么","pid":4},
        ]
        this.getJsonTree(treeList,'')