77
77
for(t = tests; t->string; t++) {
78
78
/* Better not be there */
79
79
p = (struct node *)rk_tfind((void *)t, (void **)&rootnode,
83
83
warnx("erroneous list: found %d\n", p->order);
87
87
/* Put node into the tree. */
88
88
p = (struct node *) rk_tsearch((void *)t, (void **)&rootnode,
92
92
warnx("erroneous list: missing %d\n", t->order);
97
97
rk_twalk(rootnode, list_node);
99
99
for(t = tests; t->string; t++) {
101
101
p = (struct node *) rk_tfind((void *)t, (void **)&rootnode,
105
105
warnx("erroneous list: missing %d\n", t->order);
110
110
(void) rk_tdelete((void *)t, (void **)&rootnode,
113
113
/* Better not be there */
114
114
p = (struct node *) rk_tfind((void *)t, (void **)&rootnode,
118
118
warnx("erroneous list: found %d\n", p->order);