根据条件删除树结构的元素

// 过滤 遍历 递归
function filterTree(data) {
  var newTree = data.filter(x => x.type == '1')
  newTree.forEach(x => x.children && (x.children = filterTree(x.children)))
  return newTree;
}