js 递归树结构数据查找节点，并输出从根到该节点的路径

需求，查找一个json树结构的某个节点，并输出从根节点到该节点的路径

let arrPath=[]//保存路径
let count=0
function deepFinds(node,target) {
  arrPath.push(node.value)
  if(node.value === target)
  {
    count++
  }
  if(node.children)
  {
    for (let i=0;i<node.children.length;i++)
    {
      let flag=deepFinds(node.children[i],target)
      if(!flag)
        arrPath.pop()
      else
        break
    }

  }
  return count > 0
}

deepFinds(tree, "A321")
console.log(arrPath)

tree数据

let tree={
  value:'A',
  children:[
    {value: 'A1',children: [{value:'A11'},{value:'A12'}]},
    {value: 'A2',children: [{value:'A21'},{value:'A22'}]},
    {value: 'A3',children: [{value:'A31'},{value:'A32',children:[{value:'A321'}]}]}
  ]
}