题目:实现一个对树型结构进行过滤的函数,其中树形结构的格式如下: tree = [ {name: ‘A’}, {name: ‘B’,
children: [ {name: ‘A’}, {name: ‘AA’, children: […]} ]}, {name: ‘C’}
]
假设我输入的 str 为 A 则过滤后返回的结果为 [ {name: ‘A’}, {name: ‘B’, children: [ {name: ‘A’} ]} ]
假设我输入的 str 为 AA 则过滤后返回的结果为 [ {name: ‘B’, children: [ {name: ‘AA’, children: […]} ]} ]
假设我输入的 str 为 B 则过滤后返回的结果为 [ {name: ‘B’, children: [ {name: ‘A’}, {name: ‘AA’, children: […]} ]} ]
// 实现该函数,要求不允许对原有的tree做任何修改,最终返回结果是一棵新结构出来的树 function filter (tree, str) {}
const tree = [
{
name: "A" },
{
name: "B", children: [{
name: "A" }] },
{
name