while (node != NULL) {
		if (key < node->key) {
			// Insert in left subtree
			FastIndexTreeNode *&insertin = node->left;
		} else if (key > node->key) {
			// Insert in right subtree
			FastIndexTreeNode *&insertin = node->right;
		} else {
			// key == node->key. Stop here.
			return node;
		}
		// Insert in the subtree
		if (insertin == NULL) {
			// We've reached a leaf node
			FastIndexTreeNode *insert = new FastIndexTreeNode(key, node);
			insertin = insert;
			this->updatecounts(node, 1);
			this->insertbalance(insert, -1);
			return insert;
		} else {
			// Recurse
			node = insertin;
		}
	}