es6 树结构递归

recursion(data, current) {
      let result = [];
      if (!data) {
        // return; 中断执行
        return;
      }
      for (const i in data) {
        const item = data[i];
        if (item.parentId == current) {
          result.push(item);
          // break;
        } else if (item.childList && item.childList.length > 0) {
          result = this.recursion(item.childList, current);
        }
      }
      return result;
    },