Lines Matching defs:leaf
40 node_t *root, **base, **leaf, *result, *n, *x, *y, *z;
49 * Find the leaf where the new key needs to be inserted. Return
56 leaf = &root;
57 while (*leaf != NULL) {
58 if ((*leaf)->balance != 0) {
67 base = leaf;
70 cmp = compar(key, (*leaf)->key);
73 leaf = &(*leaf)->llink;
76 leaf = &(*leaf)->rlink;
78 return (&(*leaf)->key);
83 result = *leaf = malloc(sizeof(**leaf));
97 for (n = *base; n != *leaf;) {