30           node_t **rootp = (node_t **)vrootp;  in tdelete()  local
37           if (rootp == NULL || (p = *rootp) == NULL)  in tdelete()
40           while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {  in tdelete()
41                     p = *rootp;  in tdelete()
42                     rootp = (cmp < 0) ?  in tdelete()
43                         &(*rootp)->llink :                  /* follow llink branch */  in tdelete()
44                         &(*rootp)->rlink;                   /* follow rlink branch */  in tdelete()
45                     if (*rootp == NULL)  in tdelete()
48           r = (*rootp)->rlink;                              /* D1: */  in tdelete()
49           if ((q = (*rootp)->llink) == NULL)      /* Left NULL? */  in tdelete()
59                               q->llink = (*rootp)->llink;  in tdelete()
60                               q->rlink = (*rootp)->rlink;  in tdelete()
63           free(*rootp);                                     /* D4: Free node */  in tdelete()
64           *rootp = q;                                       /* link parent to new node */  in tdelete()