【Java 查询树结构列表，递归删除子节点】-编程知识

【Java 查询树结构列表，递归删除子节点】

Java 获取列表树结构，递归删除子节点

数据库表结构
Model
VO
查询树结构列表
递归删除子节点

数据库表结构

在这里插入图片描述

Model

@Data
@AllArgsConstructor
@NoArgsConstructor
public class TBaseDept
{/** ID */private String id;/** 单位名称 */private String fdName;/** 部门编码 */private String fdCode;/** 层级 */private String fdLevel;/** 上级单位ID */private String parentId;/** 上级单位名称 */private String parentName;/** 层级ID */private String fdHier;/** 层级路径 */private String fdHierPath;/** 预留字段1 */private String fdOne;/** 预留字段2 */private String fdTwo;/** 预留字段3 */private String fdThree;/** 状态：1-正常 2:无效 */private String fdStatus;/** 排序号 */private Integer fdOrder;
}

VO

@Data
@AllArgsConstructor
@NoArgsConstructor
public class TBaseDeptVO implements Serializable
{private static final long serialVersionUID = 8599451909890724624L;/** ID */private String id;/** 单位名称 */private String fdName;/** 部门编码 */private String fdCode;/** 层级 */private String fdLevel;/** 上级单位ID */private String parentId;/** 上级单位名称 */private String parentName;/** 层级ID */private String fdHier;/** 层级路径 */private String fdHierPath;/** 预留字段1 */private String fdOne;/** 预留字段2 */private String fdTwo;/** 预留字段3 */private String fdThree;/** 状态：1-正常 2:无效 */private String fdStatus;/** 排序号 */private Integer fdOrder;private List<TBaseDeptVO> children;
}

查询树结构列表

    public List<TBaseDeptVO> queryTree(TBaseDept tBaseDept){List<TBaseDept> tBaseDeptList = tBaseDeptDao.findByCriteria(tBaseDept);return buildTree(tBaseDeptList, "0");}/*** 构建树结构* @param list 数据列表* @param parentId 父ID* @return list*/private List<TBaseDeptVO> buildTree(List<TBaseDept> list, String parentId){List<TBaseDeptVO> tree = new ArrayList<>();for (TBaseDept child : list){if (child.getParentId().equals(parentId)){TBaseDeptVO tBaseDeptVO = new TBaseDeptVO();BeanUtil.copyProperties(child, tBaseDeptVO);// 递归构建子树List<TBaseDeptVO> children = buildTree(list, child.getId());List<TBaseDeptVO> collect = children.stream().sorted(Comparator.comparing(TBaseDeptVO::getFdOrder)).collect(Collectors.toList());tBaseDeptVO.setChildren(collect);tree.add(tBaseDeptVO);}}return tree;}

递归删除子节点

    public void deleteDept(TBaseDept tBaseDept){String id = tBaseDept.getId();List<String> ids = queryChildNodes(id);tBaseDeptService.delete(ids);}/*** 递归查询所有子节点ID* @param id 父ID* @return ids*/private List<String> queryChildNodes(String id){List<String> ids = new ArrayList<>();// 查询数据库中所有与父节点关联的子节点TBaseDept dept = new TBaseDept();dept.setParentId(id);List<TBaseDept> childIds = tBaseDeptService.queryList(dept);// 递归删除子节点for (TBaseDept childId : childIds){queryChildNodes(childId.getId());ids.add(childId.getId());}ids.add(id);return ids;}