public class TestBTree {
	public static void main(String[] args) {
		BTree btree = new BTree(); // B-Baum mit Ordnung 2
		int[] toInsert = { 5, 15, 10, 20, 25, 30, 3, 4, 29, 28, 2, 21, 26, 22, 8, 12, 13 };
		String solution = "00002000011001002"; //$NON-NLS-1$
		String statusOfInsert = ""; //$NON-NLS-1$
		for (int x : toInsert) {
			statusOfInsert += btree.insert(x);
		}
		System.out.println("Das Einfuegen in den Baum hat richtig funktioniert:" + solution.equals(statusOfInsert)); //$NON-NLS-1$
		System.out.println(btree.search(26));// true
		System.out.println(btree.search(100));// false
	}
}