blob: f2482f54634d07a796404592da8d715b6e58ac26 (
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
typedef struct node {
int id;
struct node *left;
struct node *right;
} treenode;
/* FILL ME in */
breadthFirst(t)
treenode *t;
{
treenode **q;
int front, back;
front = 0;
back = 0;
q = malloc(100 * sizeof(treenode*));
*q = t;
while(q[back]){
printf("%d\n", q[back]->id);
q[++front] = q[back]->left;
q[++front] = q[back++]->right;
}
}
main (argc, argv, envp)
int argc;
char **argv, **envp;
{
treenode *t;
t = malloc(sizeof(treenode));
t->right = malloc(sizeof(treenode));
t->left = malloc(sizeof(treenode));
t->right->right = malloc(sizeof(treenode));
t->right->left = malloc(sizeof(treenode));
t->left->right = malloc(sizeof(treenode));
t->left->left = malloc(sizeof(treenode));
t->right->right->right = 0;
t->right->right->left = 0;
t->right->left->right = 0;
t->right->left->left = 0;
t->left->right->right = 0;
t->left->right->left = 0;
t->left->left->right = 0;
t->left->left->left = 0;
t->id = 1;
t->right->id = 3;
t->left->id = 2;
t->right->right->id = 7;
t->right->left->id = 6;
t->left->right->id = 5;
t->left->left->id = 4;
/* build a tree any way you like with at least 5 nodes */
/* print it out breadth first, use a queue (so write one first) */
breadthFirst(t);
}
|
