blob: 0aea005695471cb76f4ab126b16399c1c9bb281f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
|
#include <stdlib.h>
#include <stdio.h>
#include "nodelink.h"
#include "strbst.h"
node* newnode(void) {
node* new = malloc(sizeof(node));
new->links = newbst();
return new;
}
link* newlink(node* to) {
link* new = malloc(sizeof(link));
new->desc = ""; // preferred to NULL because it can be printed
new->to = to;
return new;
}
static void printlink(char* name, link* conn) {
if (conn->desc[0])
printf("%s: %s\n", name, conn->desc);
else
printf("%s\n", name);
}
static void printeach(strbstnode* loc, char reprint) {
if (loc == NULL) return;
// loc->ind is the name of the connection and loc->data the link
if (!reprint) printf(" "); // indent on subnode
printlink(loc->ind, loc->data); // prints it
if (reprint) { // and their subnodes if iterating over root tree
// prints the link's target's link tree
printeach( ( (link*)loc->data)->to->links->head, 0);
}
printeach(loc->left, reprint);
printeach(loc->right, reprint); // recursion
}
void printnode(node* root) {
printeach(root->links->head, 1);
}
|