树结构循环过滤

      const newExpandKeyArr = [];
      let tempTreeData = [];
 
let deepSearch = (children) => {
        return children.filter((item) => {
          let flag = false;
          if (item.title.includes(this.searchKeyword)) {
            newExpandKeyArr.push(item.parentId);
            flag = true;
          }
          if (item.children.length) {
            const arr = deepSearch(item.children);
            if (arr.length) {
              flag = true;
            }
          }
          return flag;
        });
      };
      for (let item of this.leftFirstKey) {
        tempTreeData = deepSearch(item.children);
      }