Lines Matching refs:NIL
89 #define NIL N /* index for root of binary search trees */
158 * is the parent of node i. These are initialized to NIL (= N), which stands
160 * tree for strings that begin with character i. These are initialized to NIL.
171 sp->rchild[i] = NIL;
173 sp->parent[i] = NIL;
192 sp->rchild[r] = sp->lchild[r] = NIL;
196 if (sp->rchild[p] != NIL)
204 if (sp->lchild[p] != NIL)
231 sp->parent[p] = NIL; /* remove p */
239 if (sp->parent[p] == NIL)
241 if (sp->rchild[p] == NIL)
243 else if (sp->lchild[p] == NIL)
247 if (sp->rchild[q] != NIL) {
250 } while (sp->rchild[q] != NIL);
264 sp->parent[p] = NIL;