递归删除数组中符合条件的元素，并返回新数组

function recursiveDeleteNode(arr, condition) {
  for (let i = arr.length - 1; i >= 0; i--) {
    const node = arr[i];
    if (condition(node)) {
      arr.splice(i, 1);
    } else if (node.children && node.children.length > 0) {
      recursiveDeleteNode(node.children, condition);
    }
  }
  return arr;
}


    let arr = recursiveDeleteNode(
      res.treeData,
      (node) =>
        node.equipmentType === "003_0014" && node.deviceSequence === null
    );