while (t) {

		MSearchTree konj(4);
		konj.insert(new Key(1));
		konj.insert(new Key(6));
		konj.insert(new Key(5));
		konj.insert(new Key(7));
		konj.insert(new Key(9));
		konj.insert(new Key(20));
		konj.insert(new Key(1));
		konj.insert(new Key(6));
		konj.insert(new Key(5));
		konj.insert(new Key(7));
		konj.insert(new Key(9));
		konj.insert(new Key(20));
		konj.insert(new Key(2));
		konj.insert(new Key(22));
		konj.insert(new Key(8));
		konj.insert(new Key(55));
		konj.insert(new Key(914));
		konj.insert(new Key(14));
		konj.insert(new Key(20));
		konj.insert(new Key(6));
		konj.insert(new Key(23));
		konj.insert(new Key(67));
		konj.insert(new Key(900));
		konj.insert(new Key(92));
		konj.insert(new Key(240));
		konj.insert(new Key(22));
		konj.insert(new Key(25));
		konj.insert(new Key(61));
		konj.insert(new Key(12));
		konj.insert(new Key(913));
		konj.insert(new Key(142));
		if (konj.lookup (new Key(21))) cout << "found\n";
		else cout << "not found\n";
		t = false;

	};