24   struct node  *llink, *rlink;  member
56 		    &(*rootp)->llink :		/* T3: follow left branch */  in rk_tsearch()
65 		q->llink = q->rlink = NULL;  in rk_tsearch()
81 	if (root->llink == NULL && root->rlink == NULL)  in trecurse()
85 		if (root->llink != NULL)  in trecurse()
86 			trecurse(root->llink, action, level + 1);  in trecurse()
129 		    &(*rootp)->llink :		/* follow llink branch */  in rk_tdelete()
135 	if ((q = (*rootp)->llink) == NULL)	/* Left NULL? */  in rk_tdelete()
138 		if (r->llink == NULL) {		/* D2: Find successor */  in rk_tdelete()
139 			r->llink = q;  in rk_tdelete()
142 			for (q = r->llink; q->llink != NULL; q = r->llink)  in rk_tdelete()
144 			r->llink = q->rlink;  in rk_tdelete()
145 			q->llink = (*rootp)->llink;  in rk_tdelete()
176 		    &(*rootp)->llink :		/* T3: follow left branch */  in rk_tfind()