-
Notifications
You must be signed in to change notification settings - Fork 1
/
线索二叉树.cpp
129 lines (113 loc) · 2.46 KB
/
线索二叉树.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
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
#include<iostream>
#include<string.h>
using namespace std;
enum PointInfo{LINK, THREAD};
template<typename T>
struct Binary
{
T _data;
Binary<T>* _pleft;
Binary<T>* _pright;
PointInfo _leftThread;
PointInfo _rightThread;
Binary(const T& data)
:_data(data)
, _pleft(NULL)
, _pright(NULL)
, _leftThread(LINK)
, _rightThread(LINK)
{}
};
template<typename T>
class BinaryTree
{
typedef Binary<T> Node;
protected:
Node* _pRoot;
public:
BinaryTree()
:_pRoot(NULL)
{}
void CreateTree(Node*& pRoot, const T arr[], size_t& index, size_t size, const T& invalid)
{
if (index < size && invalid != arr[index])
{
pRoot = new Node(arr[index]);
_CreateTree(pRoot->_pleft, arr, size, ++index, invalid);
_CreateTree(pRoot->_pright, arr, size, ++index, invalid);
}
}
//ľÝšéššÔěśţ˛ćĘ÷
BinaryTree(const T arr[], size_t size, const T& invalid)
{
size_t index = 0;
CreateTree(_pRoot, arr, size, index, invalid);
}
//Ç°ĐňĎßË÷ťŻ
void _PreThread(Node* pRoot, Node*& prev)
{
if (pRoot){
if (NULL == pRoot->_pleft){
pRoot->_pleft = prev;
pRoot->_leftThread = THREAD;
}
if (prev && NULL == pRoot->_pright){
prev->_pright = pRoot;
prev->_rightThread = THREAD;
}
prev = pRoot;
if (LINK == pRoot->_leftThread)
_PreThread(pRoot->_pleft, prev);
if (LINK = pRoot->_rightThread)
_PreThread(pRoot->_pright, prev);
}
}
void PreThread()
{
Node* prev = NULL;
_PreThread(_pRoot, prev);
}
void _MidThread(Node* pRoot, Node*& prev)
{
if (pRoot){
_MidThread(pRoot->_pleft, prev);
prev = pRoot;
if (NULL == pRoot->_pleft){
pRoot->_pleft = prev;
pRoot->_leftThread = THREAD;
}
if (prev && NULL == pRoot->_pright){
prev->_pright = pRoot;
prev->_rightThread = THREAD;
}
if (LINK = pRoot->_rightThread)
_MidThread(pRoot->_pright, prev);
}
}
void MidThread()
{
Node* prev = NULL;
_MidThread(_pRoot, prev);
}
void _PostThread(Node* pRoot, Node*& prev)
{
if (pRoot){
_PostThread(pRoot->_pleft, prev);
_PostThread(pRoot->_pright, prev);
prev = pRoot;
if (NULL == pRoot->_pleft){
pRoot->_pleft = prev;
pRoot->_leftThread = THREAD;
}
if (prev && NULL == pRoot->_pright){
prev->_pright = pRoot;
prev->_rightThread = THREAD;
}
}
}
void PostThread()
{
Node* prev = NULL;
_PostThread(_pRoot, prev);
}
};