95 	int lchild[N + 1], rchild[N + 257], parent[N + 1];  member
222 	sp->rchild[r] = sp->lchild[r] = NIL;  in insert_node()
234 			if (sp->lchild[p] != NIL) {  in insert_node()
235 				p = sp->lchild[p];  in insert_node()
237 				sp->lchild[p] = r;  in insert_node()
255 	sp->lchild[r] = sp->lchild[p];  in insert_node()
257 	sp->parent[sp->lchild[p]] = r;  in insert_node()
262 		sp->lchild[sp->parent[p]] = r;  in insert_node()
277 		q = sp->lchild[p];  in delete_node()
278 	} else if (sp->lchild[p] == NIL) {  in delete_node()
281 		q = sp->lchild[p];  in delete_node()
286 			sp->rchild[sp->parent[q]] = sp->lchild[q];  in delete_node()
287 			sp->parent[sp->lchild[q]] = sp->parent[q];  in delete_node()
288 			sp->lchild[q] = sp->lchild[p];  in delete_node()
289 			sp->parent[sp->lchild[p]] = q;  in delete_node()
298 		sp->lchild[sp->parent[p]] = q;  in delete_node()