2023年6月22日发(作者：)

java树形结构递归算法⼩结1.根据⽗节点查找下⾯所有叶⼦节点的id集合，其中selectAllChildSysDeptList⽅法中的sysDept实体为⽗节点。public List selectAllChildSysDeptList(SysDept sysDept) {List childIdList=new ArrayList<>();recursionSelect(sysDept,childIdList);return childIdList;}private void recursionSelect(SysDept sysDept,List childIdList) { //先通过parentId查找下⾯的所有叶⼦节点 SysDept dept=new SysDept(); entDeptId(tId()); List childList=SysDeptList(dept); if(!y(childList)){ for(SysDept sysDeptVo:childList){ (tId()); recursionSelect(sysDeptVo,childIdList); } }}2.获取树结构的递归算法。public List getDeptTree() {List sysDeptList = l();List treeNodeVoList = new ArrayList();if (!y(sysDeptList)) {for (SysDept sysDept : sysDeptList) {//⽗id为空的节点为根节点if (y(entDeptId())) {TreeNodeVo treeNodeVo = new TreeNodeVo();(tId());e(tName());NodeList(recursionSelect(sysDept, sysDeptList));(treeNodeVo);}}}return treeNodeVoList;}private List recursionSelect(SysDept sysDept, List sysDeptList) {List sontreeNodeVoList = new ArrayList();for (SysDept dept : sysDeptList) {TreeNodeVo treeNode = new TreeNodeVo();(tId());e(tName());if (tId().equals(entDeptId())) {NodeList(recursionSelect(dept, sysDeptList));(treeNode);}}return sontreeNodeVoList;}