67     N.left = N.right = NULL;  in splaytree_splay()
73             if (t->left == NULL) break;  in splaytree_splay()
74             if (compare(i, t->left->key) < 0) {  in splaytree_splay()
75                 y = t->left;                           /* rotate right */  in splaytree_splay()
76                 t->left = y->right;  in splaytree_splay()
79                 if (t->left == NULL) break;  in splaytree_splay()
81             r->left = t;                               /* link right */  in splaytree_splay()
83             t = t->left;  in splaytree_splay()
88                 t->right = y->left;  in splaytree_splay()
89                 y->left = t;  in splaytree_splay()
101     l->right = t->left;                                /* assemble */  in splaytree_splay()
102     r->left = t->right;  in splaytree_splay()
103     t->left = N.right;  in splaytree_splay()
104     t->right = N.left;  in splaytree_splay()
123 	new->left = new->right = NULL;  in splaytree_insert()
125 	new->left = t->left;  in splaytree_insert()
127 	t->left = NULL;  in splaytree_insert()
130 	new->left = t;  in splaytree_insert()
145 	if (t->left == NULL) {  in splaytree_delete()
148 	    x = splaytree_splay(t->left, i);  in splaytree_delete()