53 typedef struct node { char *key; struct node *llink, *rlink; } NODE;  member
73 		    &(*rootp)->llink :		/* T3: Take left branch */  in tsearch()
80 		q->llink = q->rlink = NULL;  in tsearch()
101 		    &(*rootp)->llink :		/* Take left branch */  in tdelete()
107 	if ((q = (*rootp)->llink) == NULL)	/* Llink NULL? */  in tdelete()
110 		if (r->llink == NULL) {		/* D2: Find successor */  in tdelete()
111 			r->llink = q;  in tdelete()
114 			for (q = r->llink; q->llink != NULL; q = r->llink)  in tdelete()
116 			r->llink = q->rlink;  in tdelete()
117 			q->llink = (*rootp)->llink;  in tdelete()
145 	if (root->llink == NULL && root->rlink == NULL)  in __twalk()
149 		if (root->llink != NULL)  in __twalk()
150 			__twalk(root->llink, action, level + 1);  in __twalk()