java生成一棵导航功能树-优快云博客

本文介绍了一个使用Java实现的导航功能树生成方法。通过创建多个Tree对象并利用递归函数showTree展示树形结构，该示例展示了如何构建一个多级导航菜单。文章提供了完整的代码示例，便于读者理解和实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

java生成一棵导航功能树

import java.util.ArrayList;
import java.util.List;

public class ReadConsole1 {
public static void main(String[] args) {
Tree t1 = new Tree("01", "name1", "00");
Tree t2 = new Tree("02", "name2", "01");
Tree t3 = new Tree("03", "name3", "01");
Tree t4 = new Tree("04", "name4", "02");
Tree t5 = new Tree("05", "name5", "02");
Tree t6 = new Tree("06", "name6", "04");
Tree t7 = new Tree("07", "name7", "06");
Tree t8 = new Tree("08", "name8", "07");
Tree t9 = new Tree("09", "name9", "08");
Tree t10 = new Tree("10", "name10", "09");

List<Tree> list = new ArrayList<Tree>();
list.add(t1);
list.add(t2);
list.add(t3);
list.add(t4);
list.add(t5);
list.add(t6);
list.add(t7);
list.add(t8);
list.add(t9);
list.add(t10);
showTree(list, t1, 0);
}

// 判断字母还是数字
public static void showTree(List<Tree> list, Tree tree, int deep) {
String str = "";
for (int i = 0; i < deep; i++) {
str += "*";
}
System.out.println(str + "" + tree.getName());
for (int i = 0; i < list.size(); i++) {
if (list.get(i).getPid().equals(tree.getId())) {
deep++;
showTree(list, list.get(i), deep);
deep--;
}

}
}
}

class Tree {
private String id;
private String name;
private String pid;

public Tree(String id, String name, String pid) {
this.id = id;
this.name = name;
this.pid = pid;
}

public String getId() {
return id;
}

public String getName() {
return name;
}

public String getPid() {
return pid;
}

}