int index = 1;

	while (index <= node.size() && element.compareTo(node.getElementAt(index)) > 0) {
		index += 1;
	}
	if (index <= node.size() && element == node.getElementAt(index)) {
		return new BNodePosition<T>(node, index);
	}
	if (node.isLeaf()) {
		return new BNodePosition<T>();
	}
	return search(node.getChildren().get(index), element);