29     node **rootp = (node **)vrootp;  in tsearch()  local
31     if (rootp == (struct node_t **)0)  in tsearch()
33     while (*rootp != (struct node_t *)0) {	/* Knuth's T1: */  in tsearch()
36 	if ((r = (*compar)(key, (*rootp)->key)) == 0)	/* T2: */  in tsearch()
37 	    return ((void *)*rootp);		/* we found it! */  in tsearch()
38 	rootp = (r < 0) ?  in tsearch()
39 	    &(*rootp)->left :		/* T3: follow left branch */  in tsearch()
40 	    &(*rootp)->right;		/* T4: follow right branch */  in tsearch()
44 	*rootp = q;			/* link new node to old */  in tsearch()
56     node **rootp = (node **)vrootp;  in tdelete()  local
63     if (rootp == (struct node_t **)0 || *rootp == (struct node_t *)0)  in tdelete()
65     while ((cmp = (*compar)(key, (*rootp)->key)) != 0) {  in tdelete()
66 	p = *rootp;  in tdelete()
67 	rootp = (cmp < 0) ?  in tdelete()
68 	    &(*rootp)->left :		/* follow left branch */  in tdelete()
69 	    &(*rootp)->right;		/* follow right branch */  in tdelete()
70 	if (*rootp == (struct node_t *)0)  in tdelete()
73     r = (*rootp)->right;			/* D1: */  in tdelete()
74     if ((q = (*rootp)->left) == (struct node_t *)0)	/* Left (struct node_t *)0? */  in tdelete()
84 	    q->left = (*rootp)->left;  in tdelete()
85 	    q->right = (*rootp)->right;  in tdelete()
88     free((struct node_t *) *rootp);	/* D4: Free node */  in tdelete()
89     *rootp = q;				/* link parent to new node */  in tdelete()