@Override
	public NodeList<T> search(T wert, Node<T> head) {
		NodeList<T> result = new NodeListImpl<T>();
		NodeListImpl<T> queue = new NodeListImpl<T>();
		queue.add(head);
		while (!queue.isEmpty()) {
			Node<T> node = queue.pollFirst();
			boolean exist = path.contains(node);
			if (exist == false) {
				path.add(node);
				queue.addAll(node.getChildren());
				if (node.getValue() == wert) {
					result.add(node);
				}
			}
		}
		return result;
	}