-
Notifications
You must be signed in to change notification settings - Fork 12
/
P91BuildTraverseBinaryTree.c
80 lines (69 loc) · 1.72 KB
/
P91BuildTraverseBinaryTree.c
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
// Program P9.1
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MaxWordSize 20
typedef struct {
char word[MaxWordSize+1];
} NodeData;
typedef struct treeNode {
NodeData data;
struct treeNode *left, *right;
} TreeNode, *TreeNodePtr;
typedef struct {
TreeNodePtr root;
} BinaryTree;
int main() {
TreeNodePtr buildTree(FILE *);
void preOrder(TreeNodePtr);
void inOrder(TreeNodePtr);
void postOrder(TreeNodePtr);
FILE * in = fopen("btree.in", "r");
BinaryTree bt;
bt.root = buildTree(in);
printf("\nThe pre-order traversal is: ");
preOrder(bt.root);
printf("\n\nThe in-order traversal is: ");
inOrder(bt.root);
printf("\n\nThe post-order traversal is: ");
postOrder(bt.root);
printf("\n\n");
fclose(in);
} // end main
TreeNodePtr buildTree(FILE * in) {
char str[MaxWordSize+1];
fscanf(in, "%s", str);
if (strcmp(str, "@") == 0) return NULL;
TreeNodePtr p = (TreeNodePtr) malloc(sizeof(TreeNode));
strcpy(p -> data.word, str);
p -> left = buildTree(in);
p -> right = buildTree(in);
return p;
} //end buildTree
void visit(TreeNodePtr node) {
printf("%s ", node -> data.word);
} //end visit
void preOrder(TreeNodePtr node) {
void visit(TreeNodePtr);
if (node != NULL) {
visit(node);
preOrder(node -> left);
preOrder(node -> right);
}
} //end preOrder
void inOrder(TreeNodePtr node) {
void visit(TreeNodePtr);
if (node != NULL) {
inOrder(node -> left);
visit(node);
inOrder(node -> right);
}
} //end inOrder
void postOrder(TreeNodePtr node) {
void visit(TreeNodePtr);
if (node != NULL) {
postOrder(node -> left);
postOrder(node -> right);
visit(node);
}
} //end postOrder