封装树形数据处理函数

树形数据,每一级都有唯一的标识ID

const tree = [
    {
        title:'动漫',
        children:[
            {
                title:'那啥空',
                children:[
                    {title:'春日野穹'},
                    {title:'春日野空'},
                ],
            },
            {
                title:'猫和老鼠',
                children:[
                    {title:'Tom'},
                    {title:'Jerry'},
                ]
            }
        ]
    }
]

简单递归处理

function mapTree(treeData){
    treeData.forEach(treeNode=>{
       console.log(treeNode)
    
        if(treeNode?.children?.length){
            mapTree(treeNode.children)
        }
    })

}
mapTree(tree)

提取处理方法和节点key,封装函数

function mapTree(treeData,callback,childKey='children'){
    treeData.forEach(treeNode=>{
        callback(treeNode);
    
        if(treeNode?.[childKey]?.length){
            mapTree(treeNode[childKey],callback,childKey)
        }
    })

}
mapTree(tree,treeNode=>{
    console.log(treeNode)
})

版权声明:本文为Beatingworldline原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。