1:
2:
3:
4:
5:

    3
   / \
  1   5
 / \ / \
0  2 4  6

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:

import java.util.ArrayList;

public class BinarySearchTree<T extends Comparable<T>> {
	T value;
	BinarySearchTree<T> right, left;

	public BinarySearchTree(T value) {
		this.value = value;
	}

	public void add(T toAdd) {
		if (toAdd.compareTo(value) <= 0) { // Wert ist kleiner/gleich der Wurzel
			if (left == null)
				left = new BinarySearchTree<T>(toAdd);
			else
				left.add(toAdd);
		} else { // Wert ist größer als die Wurzel
			if (right == null)
				right = new BinarySearchTree<T>(toAdd);
			else
				right.add(toAdd);
		}
	}

	public ArrayList<T> createSortedList(BinarySearchTree<T> tree) {
		return createSortedList(tree, new ArrayList<T>());
	}

	private ArrayList<T> createSortedList(BinarySearchTree<T> tree,
			ArrayList<T> list) {
		if (tree.left != null)
			createSortedList(tree.left, list);
		list.add(tree.value);
		if (tree.right != null)
			createSortedList(tree.right, list);
		return list;
	}
}

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:

import java.util.ArrayList;

public class Main {

	public static void main(String[] args) {
		BinarySearchTree<Integer> tree = new BinarySearchTree<Integer>(3);
		tree.add(1);
		tree.add(0);
		tree.add(2);
		tree.add(5);
		tree.add(4);
		tree.add(6);

		ArrayList<Integer> list = tree.createSortedList(tree);
		for (int i : list)
			System.out.println(i);
	}
}