61 	node_t **rootp = (node_t **)vrootp;  in tdelete()  local
65 	if (rootp == NULL || (p = *rootp) == NULL)  in tdelete()
68 	while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {  in tdelete()
69 		p = *rootp;  in tdelete()
70 		rootp = (cmp < 0) ?  in tdelete()
71 		    &(*rootp)->llink :		/* follow llink branch */  in tdelete()
72 		    &(*rootp)->rlink;		/* follow rlink branch */  in tdelete()
73 		if (*rootp == NULL)  in tdelete()
76 	r = (*rootp)->rlink;			/* D1: */  in tdelete()
77 	if ((q = (*rootp)->llink) == NULL)	/* Left NULL? */  in tdelete()
87 			q->llink = (*rootp)->llink;  in tdelete()
88 			q->rlink = (*rootp)->rlink;  in tdelete()
91 	free(*rootp);				/* D4: Free node */  in tdelete()
92 	*rootp = q;				/* link parent to new node */  in tdelete()