public BTreeNode largestInLeft(BTreeNode lnk) {
		state = State.largest;
		BTreeNode temp = lnk;
		while (temp.children[0] != null) {
			temp = temp.children[temp.numOfElements];
		}
		return temp;
	}