60 	node_t *p, *q, *r;  in tdelete()  local
75 	if ((q = (*rootp)->llink) == NULL)	/* Left NULL? */  in tdelete()
76 		q = r;  in tdelete()
79 			r->llink = q;  in tdelete()
80 			q = r;  in tdelete()
82 			for (q = r->llink; q->llink != NULL; q = r->llink)  in tdelete()
83 				r = q;  in tdelete()
84 			r->llink = q->rlink;  in tdelete()
85 			q->llink = (*rootp)->llink;  in tdelete()
86 			q->rlink = (*rootp)->rlink;  in tdelete()
90 	*rootp = q;				/* link parent to new node */  in tdelete()