Map<String, Kunde> map = new BinarySearchTreeMap<String, Kunde>();

		Kunde k1 = new Kunde("75202020", "20202020", "Simon", "Hansen", 5);
		Kunde k2 = new Kunde("75303030", "20303030", "Peter", "Pan", 3);
		Kunde k3 = new Kunde("75404040", "20404040", "Lone", "Jensen", 5);
		Kunde k4 = new Kunde("75101010", "20101010", "Mads", "Petersen", 14);
		Kunde k5 = new Kunde("75151515", "20151515", "Ib", "Hansen", 3);
		map.put(k1.getTlf(), k1);
		map.put(k2.getTlf(), k2);
		map.put(k3.getTlf(), k3);
		map.put(k4.getTlf(), k4);
		map.put(k5.getTlf(), k5);

		Iterator<String> keys = map.keys();
		while(keys.hasNext()) {
			System.out.print(keys.next() + ", ");
		}
		System.out.println();

		Iterator<Kunde> values = map.values();
		while(values.hasNext()) {
			System.out.print(values.next() + ", ");
		}
		System.out.println();

		map.remove("75404040");
		map.remove("75101010");

		values = map.values();
		while(values.hasNext()) {
			System.out.print(values.next() + ", ");
		}
		System.out.println();