1.方法

 function searchTree(tree, id){
    let res = ""
    let state = false
    function readTree(tree, id) {
      if(state)return
      for (let i = 0; i < tree.length; i++) {
        if (tree[i].id == id) {
          state  = true
          res = tree[i]
        } else {
          if (tree[i].children != null) {
            readTree(tree[i].children, id)
          }
        }
      }
    }
    readTree(tree,id)
    return res
  }

2.測試

let b = [
    {
      id: 1,
      name: 1,
      children: [
        {
          id: 11,
          name: 11,
          children: [
            {
              id: 13,
              name: 22,
              children: null
            }
          ]
        },
        {
          id: 12,
          name: 12,
          children: [
            {
              id: 14,
              name: 14,
              children: null
            }
          ]
        }
      ]
    }
  ]
  function searchTree(tree, id){
    let res = ""
    let state = false
    function readTree(tree, id) {
      if(state)return
      for (let i = 0; i < tree.length; i++) {
        if (tree[i].id == id) {
          state  = true
          res = tree[i]
        } else {
          if (tree[i].children != null) {
            readTree(tree[i].children, id)
          }
        }
      }
    }
    readTree(tree,id)
    return res
  }
 
  console.log(  searchTree(b, 1))
  console.log(  searchTree(b, 11))
  console.log(  searchTree(b, 13))