-
Notifications
You must be signed in to change notification settings - Fork 1
/
P267.h
182 lines (164 loc) · 3.23 KB
/
P267.h
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
#pragma once
/**************************************************
@Author: Jie Feng
@Time: 2018/11/2
@File: P267.h
@Description: The seventh week's assignment of data structure of Mr. Jianhua Lv
**************************************************/
#include <stack>
#include <iostream>
using namespace std;
/*
以下对应于英文书P267 4
*/
template<class T> class Tree;
template<class T> class InorderIterator;
template<class T>
class TreeNode
{
friend class Tree<T>;
friend class InorderIterator<T>;
public:
TreeNode(T data)
{
this->data = data;
leftChild = 0;
rightChild = 0;
}
TreeNode<T> * GetLeftChild()
{
return leftChild;
}
TreeNode<T> * GetRightChild()
{
return rightChild;
}
private:
T data;
TreeNode<T> *leftChild;
TreeNode<T> *rightChild;
};
template<class T>
class Tree
{
public:
Tree(T node)
{
root = new TreeNode<T>(node);
}
//~Tree(); //此处没有实现析构函数释放空间,会造成内存泄漏,故在P272_P273.h中实现了中序遍历实现的析构函数
TreeNode<T> * GetRoot()
{
return root;
}
void InsertToLeft(TreeNode<T> *parent, T leftChild);
void InsertToRight(TreeNode<T> *parent, T rightChild);
void NonrecPreorder();
private:
TreeNode<T> *root;
};
template<class T>
void Tree<T>::InsertToLeft(TreeNode<T> *parent, T leftChild)
{
if (!parent->leftChild)
{
parent->leftChild = new TreeNode<T>(leftChild);
}
else
{
parent->leftChild->data = leftChild;
}
}
template<class T>
void Tree<T>::InsertToRight(TreeNode<T> *parent, T rightChild)
{
if (!parent->rightChild)
{
parent->rightChild = new TreeNode<T>(rightChild);
}
else
{
parent->rightChild->data = rightChild;
}
}
template<class T>
class InorderIterator
{
public:
InorderIterator(TreeNode<T> * root)
{
currentNode = root;
}
T * Next();
private:
stack<TreeNode<T> *> s;
TreeNode<T> *currentNode;
};
template<class T>
T * InorderIterator<T>::Next()
{
while (currentNode)
{
s.push(currentNode);
currentNode = currentNode->leftChild;
}
if (s.empty()) return 0;
currentNode = s.top();
s.pop();
T &temp = currentNode->data;
currentNode = currentNode->rightChild;
return &temp;
}
/*
以下对应于英文书P267 6
*/
template<class T>
void Tree<T>::NonrecPreorder()
{
stack<TreeNode<T> *> s;
TreeNode<T> *currNode = this->GetRoot();
while (currNode != 0 || !s.empty())
{
while (currNode != 0)
{
cout << currNode->data << " ";
s.push(currNode);
currNode = currNode->leftChild;
}
if (!s.empty())
{
currNode = s.top();
s.pop();
currNode = currNode->rightChild;
}
}
}
void run_P267()
{
//P267 4
Tree<char> binaryTree('A');
binaryTree.InsertToLeft(binaryTree.GetRoot(), 'B');
binaryTree.InsertToRight(binaryTree.GetRoot(), 'C');
binaryTree.InsertToLeft(binaryTree.GetRoot()->GetLeftChild(), 'D');
binaryTree.InsertToRight(binaryTree.GetRoot()->GetLeftChild(), 'E');
binaryTree.InsertToLeft(binaryTree.GetRoot()->GetRightChild(), 'F');
binaryTree.InsertToRight(binaryTree.GetRoot()->GetRightChild(), 'G');
binaryTree.InsertToLeft(binaryTree.GetRoot()->GetLeftChild()->GetLeftChild(), 'H');
InorderIterator<char> iterator(binaryTree.GetRoot());
while (true)
{
char *result = iterator.Next();
if (result)
{
cout << *result << " ";
}
else
{
break;
}
}
//P267 6
cout << endl;
binaryTree.NonrecPreorder();
cout << endl;
}