53 typedef struct node { char *key; struct node *llink, *rlink; } NODE;  typedef
55 static void __twalk(NODE *, void (*)(const void *, VISIT, int), int);
63 	NODE **rootp = (NODE **)rtp;  in tsearch()
64 	NODE *q;	/* New node if key not found */  in tsearch()
76 	q = lmalloc(sizeof (NODE));		/* T5: Not found */  in tsearch()
90 	NODE **rootp = (NODE **)rtp;  in tdelete()
91 	NODE *p;		/* Parent of node to be deleted */  in tdelete()
92 	NODE *q;	/* Successor node */  in tdelete()
93 	NODE *r;	/* Right son node */  in tdelete()
121 	lfree(*rootp, sizeof (NODE));		/* D4: Free node */  in tdelete()
132 	NODE *root = (NODE *)rt;  in twalk()
141 __twalk(NODE *root,		/* Root of the tree to be walked */  in __twalk()