diff options
| -rw-r--r-- | btree-int.c | 14 | ||||
| -rw-r--r-- | btree-str.c | 17 |
2 files changed, 11 insertions, 20 deletions
diff --git a/btree-int.c b/btree-int.c index 7dbdf90..592c9c2 100644 --- a/btree-int.c +++ b/btree-int.c @@ -16,25 +16,21 @@ void an(Node **r, Node *n) { *r = n; return; } - if (n->v > (*r)->v) { + if (n->v > (*r)->v) an(&((*r)->r), n); - } else { + else an(&((*r)->l), n); - } return; } void pn(Node *n) { - if (!n) { + if (!n) return; - } - if (n->l) { + if (n->l) pn(n->l); - } fprintf(stdout, "%ld\n", n->v); - if (n->r) { + if (n->r) pn(n->r); - } return; } diff --git a/btree-str.c b/btree-str.c index 539f03a..1e0903a 100644 --- a/btree-str.c +++ b/btree-str.c @@ -17,32 +17,27 @@ void an(Node **r, Node *n) { *r = n; return; } - if (strcmp(n->v, (*r)->v) > 0) { + if (strcmp(n->v, (*r)->v) > 0) an(&((*r)->r), n); - } else { + else an(&((*r)->l), n); - } return; } void pn(Node *n) { - if (!n) { + if (!n) return; - } - if (n->l) { + if (n->l) pn(n->l); - } fprintf(stdout, "%s\n", n->v); - if (n->r) { + if (n->r) pn(n->r); - } return; } void fn(Node *n) { - if (!n) { + if (!n) return; - } if (n->l) fn(n->l); if (n->r) |