//一维数组转树结构
function ArrayToTree(list){
    let treeNodeList = [];
    for (let i = 0; i < list.length; i++) {
        let status = false;
        let element = list[i];

        //第二个循环 start
        for (let k = 0; k < list.length; k++) {
            let item = list[k];
            if(!['',0,'0',null,undefined].includes(element.parentId) && element.parentId == item.id){
                //有上下级关系
                status = true;
                if(!item.children){
                    item.children = [];
                }
                item.children.push(element);//添加子节点
                break;
            }
        }
        //第二个循环 end

        if(!status){
            //一级节点
            treeNodeList.push(element);
        }
    }

    return treeNodeList;
}



var list = [
    {
        id:'1',
        parentId:'',
        name:'陈天'
    },{
        id:'2',
        parentId:'1',
        name:'李白'
    },{
        id:'3',
        parentId:'',
        name:'王大装'
    },{
        id:'4',
        parentId:'2',
        name:'钱多多'
    },{
        id:'6',
        parentId:'2',
        name:'朱明'
    },{
        id:'7',
        parentId:'5',
        name:'黄民'
    },{
        id:'8',
        parentId:'6',
        name:'刘豪'
    },
]
ArrayToTree(list);