Lines Matching refs:NIL
101 #define NIL N /* index for root of binary search trees */
177 * is the parent of node i. These are initialized to NIL (= N), which stands
179 * tree for strings that begin with character i. These are initialized to NIL.
190 sp->rchild[i] = NIL;
192 sp->parent[i] = NIL;
211 sp->rchild[r] = sp->lchild[r] = NIL;
215 if (sp->rchild[p] != NIL)
223 if (sp->lchild[p] != NIL)
250 sp->parent[p] = NIL; /* remove p */
258 if (sp->parent[p] == NIL)
260 if (sp->rchild[p] == NIL)
262 else if (sp->lchild[p] == NIL)
266 if (sp->rchild[q] != NIL) {
269 } while (sp->rchild[q] != NIL);
283 sp->parent[p] = NIL;