js的tree数组对象扁平化思否_JS中树形对象与数组之间的相互转换 菜单树

JS中树形对象与数组之间的相互转换
js的tree数组对象扁平化思否_JS中树形对象与数组之间的相互转换
https://www.cnblogs.com/liquanjiang/p/11405480.html

在工作中经常会遇到树形结构的对象转为数组或者数组转为树形对象的需求，那么如何实现呢？

 

1、首先是要将一个具有树形结构的数组转化为树形结构的对象

// 将一个扁平化的对象数组，转化为树形结构
// 现在有一个对象组成的数组，每个元素有id属性和parent_id属性，根据其id属性和parent_id属性，将其转换为树结构的对象
const arr = [
   {
       id: '1',
       parent_id: 'root',
       name:'abc'
   },
   {
       id: '2',
       parent_id: 'root',
       name:'abc'
   },
   {
       id: '1-1',
       parent_id: '1',
       name:'abc'
   },
   {
       id: '1-2',
       parent_id: '1',
       name:'abc'
   },
   {
       id: '1-1-1',
       parent_id: '1-1',
       name:'abc'
   },
   {
       id: '1-1-2',
       parent_id: '1-1',
       name:'abc'
   },
   {
       id: '1-2-1',
       parent_id: '1-2',
       name:'abc'
   },
   {
       id: '2-1',
       parent_id: '2',
       name:'abc'
   },
   {
       id: '2-2',
       parent_id: '2',
       name:'abc'
   },
   {
       id: '2-1-1',
       parent_id: '2-1',
       name:'abc'
   },
   {
       id: '2-2-1',
       parent_id: '2-2',
       name:'abc'
   },
   {
       id: '2-2-1-1',
       parent_id: '2-2-1',
       name:'abc'
   },
   {
       id: '2-2-1-2',
       parent_id: '2-2-1',
       name:'abc'
   },
    {
       id: '2-2-1-2-1',
       parent_id: '2-2-1-2',
       name:'abc'
   },
   {
       id: '2-3',
       parent_id: '2',
       name:'abc'
   },
   {
       id: '2-3-1',
       parent_id: '2-3',
       name:'abc'
   },
   {
       id: '3',
       parent_id: 'root',
       name:'abc'
   },   
];
// 将这样一个数组，变成能够以树形展示的对象
//先将数组中的每一个节点放到temp对象中（创建set）

//即数组中有{id: '2-3', parent_id: '2',...}这样一个节点，需要将他放到temp中变成 '2-3': {id: '2-3', parent_id: '2',...}这种JSON结构

//直接遍历整个temp对象，通过这句代码   temp[temp[i].parent_id].children[temp[i].id] = temp[i];  

//将当前子节点与父节点建立连接。是因为我们保证了父节点一定在子节点前，

//那么当子节点出现的时候就直接可以用temp[temp[i].parent_id]来查找到父节点这个时候先父节点的children对象中添加一个引用即可。
function buildTree(array,id,parent_id) {

console.time('123');

// 创建临时对象

let temp = {};

// 创建需要返回的树形对象

let tree = {};

// 先遍历数组，将数组的每一项添加到temp对象中

for(let i in array) {

temp[array[i][id]] = array[i];

}
</span><span style="color: rgba(0, 128, 0, 1)">/*</span><span style="color: rgba(0, 128, 0, 1)">  上面也可以写成
for(let i=0;i&lt;array.length;i++) {
    temp[array[i][id]] = array[i];
}
</span><span style="color: rgba(0, 128, 0, 1)">*/</span>

<span style="color: rgba(0, 128, 0, 1)">//</span><span style="color: rgba(0, 128, 0, 1)"> 遍历temp对象，将当前子节点与父节点建立连接</span>
<span style="color: rgba(0, 0, 255, 1)">for</span>(let i <span style="color: rgba(0, 0, 255, 1)">in</span><span style="color: rgba(0, 0, 0, 1)"> temp) {
    </span><span style="color: rgba(0, 128, 0, 1)">//</span><span style="color: rgba(0, 128, 0, 1)"> 判断是否是根节点下的项</span>
    <span style="color: rgba(0, 0, 255, 1)">if</span>(temp[i][parent_id] !== 'root'<span style="color: rgba(0, 0, 0, 1)">) {
         </span><span style="color: rgba(0, 0, 255, 1)">if</span>(!<span style="color: rgba(0, 0, 0, 1)">temp[temp[i][parent_id]].children) {
             temp[temp[i][parent_id]].children </span>= <span style="color: rgba(0, 0, 255, 1)">new</span><span style="color: rgba(0, 0, 0, 1)"> Array();
         }
         temp[temp[i][parent_id]].children.push(temp[i]);
    } </span><span style="color: rgba(0, 0, 255, 1)">else</span><span style="color: rgba(0, 0, 0, 1)"> {
        tree[temp[i][id]] </span>=<span style="color: rgba(0, 0, 0, 1)"> temp[i];
    }
}

</span><span style="color: rgba(0, 128, 0, 1)">/*</span><span style="color: rgba(0, 128, 0, 1)">  上面也可以写成
for(let i=0;i&lt;array.length;i++) {
    temp[array[i][id]] = array[i];
}
</span><span style="color: rgba(0, 128, 0, 1)">*/</span><span style="color: rgba(0, 0, 0, 1)">

console.timeEnd(</span>'123'<span style="color: rgba(0, 0, 0, 1)">);
</span><span style="color: rgba(0, 0, 255, 1)">return</span><span style="color: rgba(0, 0, 0, 1)"> tree;

}
const obj = buildTree(arr, 'id', 'parent_id');

console.log(obj);

 

2、树形结构转化为一维扁平数组

const treeObj = {
    id: '0',
    name: '0',
    children:[
        {
            id: '1',
            name:'anc',
            children:[
                 {
                    id: '1-1',
                    name:'anc',
                    children:[
                        {
                            id: '1-1-1',
                            name:'anc',
                        },    
                        {
                            id: '1-1-2',
                            name:'anc'
                        },    
                    ]
                },    
                {
                    id: '1-2',
                    name:'anc',
                    children:[
                        {
                            id: '1-2-1',
                            name:'anc',
                        },    
                        {
                            id: '1-2-2',
                            name:'anc'
                        },    
                    ]
                },    
            ]
        },
        {
            id: '2',
            name:'anc',
            children:[
                 {
                    id: '2-1',
                    name:'anc',
                    children:[
                        {
                            id: '2-1-1',
                            name:'anc',
                        },    
                        {
                            id: '2-1-2',
                            name:'anc'
                        },    
                    ]
                },    
                {
                    id: '2-2',
                    name:'anc',
                    children:[
                        {
                            id: '2-2-1',
                            name:'anc',
                            children: [
                                {
                                    id: '2-2-1-1',
                                    name:'anc',
                                },    
                                {
                                    id: '2-2-1-2',
                                    name:'anc'
                                },    
                            ]
                        },    
                        {
                            id: '2-2-2',
                            name:'anc'
                        },    
                    ]
                },    
                {
                    id: '2-3',
                    name:'anc',
                    children:[
                        {
                            id: '2-3-1',
                            name:'anc',
                        },    
                        {
                            id: '2-3-2',
                            name:'anc'
                        },    
                    ]
                },    
            ]
        },
        {
            id: '3',
            name:'anc',
            children:[]
        }    
    ]
};
// 将treeObj中的所有对象，放入一个数组中，要求某个对象在另一个对象的children时，其parent_id是对应的另一个对象的id
// 其原理实际上是数据结构中的广度优先遍历
function tree2Array(treeObj, rootid) {

const temp = [];  // 设置临时数组，用来存放队列

const out = [];    // 设置输出数组，用来存放要输出的一维数组

   temp.push(treeObj);

// 首先把根元素存放入out中

let pid = rootid;

const obj = deepCopy(treeObj);

obj.pid = pid;

delete obj['children'];

out.push(obj)

// 对树对象进行广度优先的遍历

while(temp.length > 0) {

const first = temp.shift();

const children = first.children;

if(children && children.length > 0) {

pid = first.id;

const len = first.children.length;

for(let i=0;i<len;i++) {

temp.push(children[i]);

const obj = deepCopy(children[i]);

obj.pid = pid;

delete obj['children'];

out.push(obj)

}

}

}

return out

}
console.log(tree2Array(treeObj, 'root'))
// 深拷贝

function deepCopy(obj){

// 深度复制数组

if(Object.prototype.toString.call(obj) === "[object Array]"){

const object=[];

for(let i=0;i<obj.length;i++){

object.push(deepCopy(obj[i]))

}

return object

}

// 深度复制对象

if(Object.prototype.toString.call(obj) === "[object Object]"){

const object={};

for(let p in obj){

object[p]=obj[p]

}

return object

}

}