Vue, js, element two-dimensional array conversion tree list

1. Directly upload the code

/**
 * 递归树形 数据处理
 * @param {Array} list
 * @param {string} parentId 父级id字段
 * @param {string} uniqueId 唯一id字段
 * @returns {Array} 
 */
//数据处理
export function getTreeListData(list, parentId, uniqueId) {
    
    
    let dataArray = [];
    list.forEach(function(data) {
    
    
        let departmentParentId = data[parentId];
        //判断根据实际自行修改
        if (departmentParentId === "0") {
    
    
            dataArray.push(data);
        }
    });
    return data2treeDG(list, dataArray, parentId, uniqueId);
}

function data2treeDG(datas, dataArray, parentId, uniqueId) {
    
    
    for (let j = 0; j < dataArray.length; j++) {
    
    
        let dataArrayIndex = dataArray[j];
        let childrenArray = [];
        let Id = dataArrayIndex[uniqueId];
        for (let i = 0; i < datas.length; i++) {
    
    
            let data = datas[i];
            let departmentParentId = data[parentId];
            if (departmentParentId == Id) {
    
    
                childrenArray.push(data);
            }
        }

        if (childrenArray.length > 0) {
    
    
            //有儿子节点则递归  children 字段根据实际自行修改
            dataArrayIndex.children = childrenArray;
            data2treeDG(datas, childrenArray, parentId, uniqueId);
        }
    }
    return dataArray;
}

2. Best performance

/**
 * 递归树形 数据处理
 * @param {Array} items 需要处理的数组
 * @param {string} fid 指定父级id字段默认为0
 * @returns {Array} 
 */
 function arrayToTree2(items, fid=0) {
    
    
            const result = []; // 存放结果集
            const itemMap = {
    
    }; // 
            for (const item of items) {
    
    
                const id = item.id;
                const pid = item.pid;

                if (!itemMap[id]) {
    
    
                    itemMap[id] = {
    
    
                        children: [],
                    }
                }

                itemMap[id] = {
    
    
                    ...item,
                    children: itemMap[id]['children']
                }

                const treeItem = itemMap[id];

                if (pid === fid) {
    
    
                    result.push(treeItem);
                } else {
    
    
                    if (!itemMap[pid]) {
    
    
                        itemMap[pid] = {
    
    
                            children: [],
                        }
                    }
                    itemMap[pid].children.push(treeItem)
                }

            }
            return result;
        }