需要启动二叉树的帮助吗?
|
我需要朝正确的方向轻推。到目前为止,我已经对此进行了编码>>
import java.util.Scanner;
class clubmember {
public static void main(String[] args) {
int id;
String fname, lname;
Scanner input = new Scanner(System.in);
System.out.println(\"ID>\");
id = input.nextInt();
System.out.println(\"Fname >\");
fname = input.next();
System.out.println(\"lname >\");
lname = input.next();
Person object1 = new Person(id, fname, lname);
System.out.println(object1);
}
}
public class Person {
private final int id;
private final String firstName;
private final String lastName;
public Person(int id, String firstName, String lastName) {
this.id = id;
this.firstName = firstName;
this.lastName = lastName;
}
public int getId() {
return id;
}
public String getFirstName() {
return firstName;
}
public String getLastName() {
return lastName;
}
@Override
public String toString() {
return String.valueOf(id) + \": \" + firstName + \" \" + lastName;
}
}
我需要创建一个显示名称与成员ID的二叉树。我看了无休止的二叉树,但对它们实际上是如何获取此信息然后进行处理感到困惑。谁能给我一个起点或一些与此类似的示例代码?
没有找到相关结果
已邀请:
1 个回复
社攻取墟槽