java - 需要帮助启动二叉树吗？

Question

我需要朝正确的方向插入。到目前为止我已经编码了>>

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 和名称。我看过无数的二叉树，但很困惑它们如何实际获取这些信息然后继续处理它。谁能给我一个起点或一些与此类似的示例代码？

Answer 1

阅读这篇精彩的文章introduction to binary trees来自斯坦福计算机科学图书馆。