一. 将普通数组转化成树结构
this.arr = [{ parentId: 0,id: 1,level: 1,type: '一级类型',code: '101#',createName: '张三'},{ parentId: 1, id: 11, level: 2, type: '2级类型', code: '101#', createName: '张三',}]
this.dataList = this.arrList(this.arr, 0) // 调用递归,初始pid为0或是null(看具体返回数据而定)
arrList(data, pid) { // 递归 使数组变成tree结构
const itemArr = []
for (let i = 0; i < data.length; i++) {
const node = data[i]
if (node.parentId === pid) {
const newNode = {}
newNode.id = node.id
newNode.parentId = node.parentId
newNode.level = node.level
newNode.type = node.type
newNode.children = this.ar