Java将txt文件读取到树数据结构中

Question

I need help in implementing tree structure, I created the add child function that adds data to tree but there seems to be a problem while adding the child.

What I want the tree to look like:

                 Date
            /      |      \
           /       |        \
         /         |         \
       /           |           \
  20160101     20160102     20160103
    /               |       |        \
 12:00           13:00    12:00      13:00
 /    \           /   \     |       /    \
Here  There     Here There Here Here     There

example txt file:

Date,Time,Location
20160101,12:00,Here
20160101,12:00,There
20160102,13:00,Here
20160102,13:00,There
20160103,12:00, Here
20160103,13:00, Here
20160103,13:00, There

The output for the date seems fine, it shows 2 dates since I don't want the same date to show up twice but the time and location is wrong.

EXPECTED:

20160101
12:00
Here
There
20160102
13:00
Here
There
20160103
12:00
Here
13:00
Here
There

ACTUAL:

20160101
12:00
Here
There
13:00
Here
There
20160102
12:00
Here
There
13:00
Here
There
20160103
12:00
Here
There
13:00
Here
There

I appreciate any help or feedback for my code.

public class Tree {
    List<Tree> children = new ArrayList<Tree>();
    Tree parent = null;
    String data = null;

    public Tree(String data) {
        this.data = data;
    }

    public Tree(String data, Tree parent){
        this.data = data;
        this.parent = parent;
    }

    public void addChild(String data) {
        Tree child = new Tree(data);
        child.parent = this;
        Boolean match = false;
        for (int i = 0; i < this.children.size(); i++) {
            if (this.children.get(i).data.equals(child.data)) {
                match = true;
                break;
            }
        }
        if (!match) {
            this.children.add(child);
        }
    }

    public void addChild(Tree child) {
        Boolean match = false;
        for (int i = 0; i < this.children.size(); i++) {
            if (this.children.get(i).data.equals(child.data)) {
                match = true;
                break;
            }
        }
        if (!match) {
            this.children.add(child);
        }
    }

    public static void main(String[] args) throws IOException {
        long startTime = System.nanoTime();
        Scanner scanFile = new Scanner(new File("example.txt"));
        String line = "";
        line = scanFile.nextLine();
        Tree parentNode = new Tree(line.split(",")[0]);
        Tree dateNode = new Tree(null, parentNode);
        Tree timeNode = new Tree(null, dateNode);
        Tree locationNode = new Tree(null, timeNode);
        System.out.println(parentNode.data);

        while(scanFile.hasNext()) {
            line = scanFile.nextLine();

            timeNode.addChild(line.split(",")[2]);
            dateNode.addChild(line.split(",")[1]);
            parentNode.addChild(line.split(",")[0]);
        }
        scanFile.close();



        for(int i =0; i < parentNode.children.size(); i++) {
            System.out.println(parentNode.children.get(i).data);
            for(int j = 0; j < dateNode.children.size(); j++) {
                System.out.println(dateNode.children.get(j).data);
                for(int k = 0; k < timeNode.children.size(); k++) {
                    System.out.println(timeNode.children.get(k).data);
            }
    }

    long endTime = System.nanoTime();
    System.out.println("Time taken: " + (endTime - startTime) / 1E9 + "s");
    }
}

Answer 1

Try these:

List<String> lines = new ArrayList<>();
Map<String,Map<String,List<String>>> tree = new TreeMap<String,Map<String,List<String>>>();

    for(int i=0;i<lines.size();i++){

        String[] parts = lines.get(i).split(",");

        if(!tree.containsKey(parts[0])){
            tree.put(parts[0],new TreeMap<String,List<String>>());
        }

        Map<String,List<String>> tree2 = tree.get(parts[0]);

        if(!tree.containsKey(parts[1])){
            tree2.put(parts[1],new ArrayList<String>());
        }

        List<String> tree3 = tree2.get(parts[1]);

        if(!tree3.contains(parts[2])){
            tree3.add(parts[2]);
        }

    }