JS实现无限层级的树状的算法
以下是待转化的数组(以权限作为例子,parent_id代表其父节点Id):
const list = [
{
id: 1, name: '超级管理', parent_id: 0},
{
id: 2, name: '用户管理', parent_id: 1},
{
id: 3, name: '部门管理', parent_id: 1},
{
id: 4, name: '日志管理', parent_id: 1},
{
id: 5, name: '操作用户', parent_id: 2},
{
id: 6, name: '查看用户', parent_id: 2},
{
id: 7, name: '用户新增', parent_id: 5},
{
id: 8, name: '用户删除', parent_id: 5},
{
id: 9, name: '用户修改', parent_id: 5},
{
id: 10, name: '操控部门', parent_id: 3},
{
id: 11, name: '查看部门', parent_id: 3},
{
id: 12, name: '部门新增', parent_id: 10},
{
id: 13, name: '部门删除', parent_id: 10},
{
id: 14, name: '部门修改', parent_id: 10},
{