Function splay_delete

libCacheSim/dataStructure/splay.c:195–217

}

sTree * splay_delete(key_type i, sTree * t) {
    /* Deletes i from the sTree if it's there.               */
    /* Return a pointer to the resulting sTree.              */
    sTree * x;
    if (t==NULL) return NULL;
    long root_value = t->value;
    t = splay(i,t);
    if (key_cmp(i, t->key) == 0) {               /* found it */
        if (t->left == NULL) {
            x = t->right;
        } else {
            x = splay(i, t->left);      // i is the largest element in left sub sTree,
                                        // so the new splay sTree does not have right sub sTree 
            x->right = t->right;
        }
        free_node(t);
        if (x != NULL) {
            x->value = root_value-1;
        }
        return x;
    }
    return t;                         /* It wasn't there */
}


//sTree *find_node(key_type e, sTree *t) {