学习随笔01-扁平数据结构转为树结构（map）

原数据结构

var arr = [
    {id: 1, name: 'A', pid: 0},
    {id: 2, name: 'B', pid: 1},
    {id: 3, name: 'C', pid: 1}
]

树状数据结构

[
    {
        "id": 1,
        "name": "A",
        "pid": 0,
        "children": [
            {
                "id": 2,
                "name": "B",
                "pid": 1,
                "children": []
            },
            {
                "id": 3,
                "name": "C",
                "pid": 1,
                "children": []
            }
        ]
    }
]

function arrayToTree(items) {
	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 === 0) {
      result.push(treeItem);
    } else {
      if (!itemMap[pid]) {
        itemMap[pid] = {
        	children: [],
        }
      }
      itemMap[pid].children.push(treeItem)
    }

  }
  return result;
}

转载自： https://juejin.cn/post/6983904373508145189