class UebungTraversierung {

	public void traversierung(BinaryTree b, List l) {
		//Dieses muss geaendert werden
		l.append(b.getContent());
		l.append(b.getRightTree().getContent());
	}

	public static void main(String[] args) {
		BinaryTree<String> tree = new BinaryTree<String>("G");
		tree.setLeftTree(new BinaryTree<String>("D"));
		tree.setRightTree(new BinaryTree<String>("X"));
		tree.getLeftTree().setLeftTree(new BinaryTree<String>("J"));
		tree.getLeftTree().setRightTree(new BinaryTree<String>("C"));
		tree.getRightTree().setLeftTree(new BinaryTree<String>("L"));
		tree.getRightTree().setRightTree(new BinaryTree<String>("W"));
		tree.getRightTree().getRightTree().setLeftTree(new BinaryTree<String>("B"));
		tree.getRightTree().getRightTree().setRightTree(new BinaryTree<String>("M"));

		UebungTraversierung ue = new UebungTraversierung();
		List l = new List<String>();
		ue.traversierung(tree, l);

		l.toFirst();
		while (l.hasAccess()) {
			System.out.print(l.getContent() + " ");
			l.next();
		}
		System.out.println("");

		//Ergebnise:
		//Pre-Order G D J C X L W B M 
		//Post-Order J C D L B M W X G 
		//In-Order J D C G L X B W M 
		
	}
}