一道算法题:
let tree = [
{
'name': 'a-0',
children: [
{
name: 'a-1-1',
children: [
{
name: 'a-2-1'
}
]
},
{
name: 'a-1-2',
children: [
{
name: 'a-2-2'
}
]
}
]
},
{
'name': 'b-0',
children: [
{
name: 'b-1-1',
children: [
{
name: 'b-2-1'
}
]
},
{
name: 'b-1-2',
children: [
{
name: 'b-2-2'
}
]
}
]
}
]
在每一级数组开始位置增加一项:
{
name: 'all',
children: [
....
]
}
children
的值为同级兄弟节点的 chilren
合并值