Use of recursion: 1. Convert the tiled array to a tree 2. Convert the tree to a tiled array

Tile array

    const flatData= [
	    {
    id: '1', parentId: 'root', name:'1'},
	    {
    id: '1-1', parentId: '1', name:'1-1'},
	    {
    id: '1-2', parentId: '1', name:'1-2'},
	    {
    id: '1-1-1', parentId: '1-1', name:'1-1-1'},
	    {
    id: '1-1-2', parentId: '1-1', name:'1-1-2'},
	    {
    id: '1-2-1', parentId: '1-2', name:'1-2-1'}
	];

Tree array targetData

const targetData=[
	 {
    
	 	id: '1', 
	 	parentId: 'root', 
	 	name:'1',
	 	children:[
	 		{
    
	 			id: '1-1', 
	 			parentId: '1', 
	 			name:'1-1',
	 			children:[
			 		{
    
			 			id: '1-1-1', 
			 			parentId: '1-1', 
			 			name:'1-1-1'
			 		},
			 		{
    
			 			id: '1-1-2', 
			 			parentId: '1-1', 
			 			name:'1-1-2'
			 		},
			 	]
	 		},
	 		{
    
	 			id: '1-2',
	 			parentId: '1', 
	 			name:'1-2',
	 			children:[
			 		{
    
			 			id: '1-2-1', 
			 			parentId: '1-2', 
			 			name:'1-2-1'
			 		},
			 	]
	 		},
	 	]
	 },
]

Specific code implementation ：

1. Turn a tiled array into a tree

Key points : Father's id It's a child's parentId

function getTreeData(data,id){
    
    let arr = []
    data.forEach((item,index) => {
    
        let children =  getTreeData(data,item.id)
            if(children.length){
    
                item.children = children
            }
            arr.push(item)
    });
    return arr
}
const treeData= getTreeData(flatData, 'root');
console.log('tree', targetArr);

2. Convert a tree to a tiled array

let flatData= []
function getFlatData(data){
    
   data.forEach((item,index)=>{
    
        if(item.children&&item.children.length){
    
            getTreeFlatData(item.children)
            delete item.children
        }
        flatData.push(item) 
   })

}
getFlatData(treeData)
console.log(flatData)