递归循环多级组织树

最新推荐文章于 2024-09-30 14:28:41 发布

ygbwan

最新推荐文章于 2024-09-30 14:28:41 发布

阅读量117

点赞数 1

文章标签： javascript 数据结构开发语言

本文链接：https://blog.csdn.net/ygbwan/article/details/130381487

版权

const convertTrees = (tree: IObject[]) => {
  const result: IObject[] = [];
  let getItem: IObject = {};
  // 遍历 tree
  tree.forEach((item: IObject) => {
    getItem = {
      value: `${item.companyCode}_${item.departmentCode}`,
      label: item.departmentName,
      children: item.nextLevelDepartments,
      pid: item.parentDepartmentCode,
      parentTreeLevel: item.parentTreeLevel,
      isLeaf: item.nextLevelDepartments?.length === 0
    };
    // 如果有子节点，递归
    if (getItem?.children?.length > 0) {
      getItem.children = convertTrees(getItem?.children);
    } else {
      getItem.children = [];
    }
    // 解构赋值
    const { value, label, children, pid, parentTreeLevel, isLeaf } = getItem;

    result.push({
      value,
      label,
      children,
      pid,
      parentTreeLevel,
      isLeaf
    });
  });
  return result;
};