tk.hongkailiu.test.app.tree.other.SimpleTree Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of test-app Show documentation
The newest version!
package tk.hongkailiu.test.app.tree.other;

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

public class SimpleTree> {
    // Hongkai: remove private modifier of the fields: allowing access for class in the same package
    E value;
    SimpleTree left;
    SimpleTree right;

    public SimpleTree(E value, SimpleTree left, SimpleTree right) {
        this.value = value;
        this.left = left;
        this.right = right;
    }

    public E getValue() {
        return value;
    }

    public SimpleTree getLeft() {
        return left;
    }

    public SimpleTree getRight() {
        return right;
    }

    /**
     * Hongkai
     * test more: print the tree
     * ref. http://stackoverflow.com/questions/4965335/how-to-print-binary-tree-diagram
     */
    public void print() {
        print("", true, "X");
    }

    private void print(String prefix, boolean isTail, String index) {
        System.out
            .println(prefix + (isTail ? ("└─(" + index + ")─ ") : "├─(" + index + ")─ ") + value);
        final List> children = new ArrayList>();
        children.add(left);
        children.add(right);

        for (int i = 0; i < children.size() - 1; i++) {
            if (children.get(i) != null)
                children.get(i)
                    .print(prefix + (isTail ? "       " : "│      "), false, Integer.toString(i));
        }
        if (children.size() > 0) {
            if (children.get(children.size() - 1) != null)
                children.get(children.size() - 1)
                    .print(prefix + (isTail ? "       " : "│      "), true,
                        Integer.toString(children.size() - 1));
        }
    }

    /**
     * ref. http://en.wikipedia.org/wiki/Tree_traversal
     * Hongkai: test more
     *
     * @return td
     */
    public List getValuesInOrder() {
        List list = new LinkedList();
        if (left != null) {
            list.addAll(left.getValuesInOrder());
        }
        list.add(value);
        if (right != null) {
            list.addAll(right.getValuesInOrder());
        }
        return list;
    }
}