-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryTree.cpp
75 lines (75 loc) · 1.35 KB
/
BinaryTree.cpp
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
#define LOCA
#include<iostream>
using namespace std;
class binaryTree;
class binaryTreeNode
{
friend binaryTree;
friend void visit(binaryTreeNode*);
char element;
binaryTreeNode* leftChild, *rightChild;
public:
binaryTreeNode() {};
binaryTreeNode(char theElement)
{
element = theElement;
leftChild = rightChild = NULL;
}
binaryTreeNode(char theElement, binaryTreeNode* left, binaryTreeNode* right)
{
element = theElement;
leftChild = left;
rightChild = right;
}
};
class binaryTree
{
public:
binaryTreeNode* node;
public:
binaryTree(binaryTreeNode* theNode)
{
node = new binaryTreeNode(theNode->element);
}
binaryTree() { node = new binaryTreeNode; };
void inOrderVisit(binaryTreeNode* t)
{
if (t != NULL)
{
inOrderVisit(t->leftChild);
visit(t);
inOrderVisit(t->rightChild);
}
}
void preOrderBuild(binaryTreeNode*& t, char* ch, int& num, int len)
{
if (num < len)
{
if (ch[num] == '#') num++;
else
{
t = new binaryTreeNode(ch[num]);
num++;
preOrderBuild(t->leftChild, ch, num,len);
preOrderBuild(t->rightChild, ch, num,len);
}
}
}
};
void visit(binaryTreeNode* t)
{
cout << t->element << " ";
}
int main()
{
char t[101];
cin >> t;
binaryTree tree;
int num = 0;
int len = strlen(t);
tree.preOrderBuild(tree.node, t, num, len);
tree.inOrderVisit(tree.node);
#ifdef LOCA
system("pause");
#endif
}