3.递归求值

let treeList = [{id: '1',name: '父一',children: [{id: '1-1',name: '子一',children: [{ id: '1-1-1', name: '孙一一', children: null },{ id: '1-1-2', name: '孙一二', children: null },{ id: '1-1-3', name: '孙一三', children: null }]},]},{id: '2',name: '父二',children: [{ id: '2-1', name: '子二一', children: null },{ id: '2-2', name: '子二一', children: null },{ id: '2-3', name: '子二一', children: null }]},{id: '3',name: '父三',children: null}
]function find(treeList,code) {for(let i in treeList){//循环遍历，当id相等的时候  返回他的nameif (treeList[i].id == code) {return treeList[i].name}//如果不满足上面的条件，且还有children属性，执行下面代码if(treeList[i].children){//递归赋值let node = find(treeList[i].children,code)console.log(node + '这是node');//当node有值得时候，把子节点 父节点 关联的全部输出if (node !== undefined) {return node.concat(treeList[i].name)}}}
}
console.log(find(treeList,'1-1-1'));