Repository navigation
Expand file tree
/
Copy pathConstructTree.cpp
More file actions
117 lines (89 loc) · 3.12 KB
/
Copy pathConstructTree.cpp
File metadata and controls
117 lines (89 loc) · 3.12 KB
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
#include "TreeCommon.hpp"
using namespace std;
template<typename T> using cItr = typename vector<T>::iterator;
template<typename T> using Size = typename vector<T>::size_type;
template<typename T, typename It = cItr<T>, typename Sz = Size<T>>
BinaryTreeNode<T> *Construct(It iterPreBegin, It iterInBegin, Sz size);
template<typename T>
BinaryTreeNode<T> *ConstructTree(vector<T>& vecPreOrder, vector<T>& vecInOrder)
{
if (vecPreOrder.empty() || vecInOrder.empty() || vecPreOrder.size() != vecInOrder.size())
{
return nullptr;
}
BinaryTreeNode<T> *pRet = Construct<T, cItr<T>, Size<T>>(vecPreOrder.begin(), vecInOrder.begin(), vecPreOrder.size());
return pRet;
}
template<typename T, typename It = cItr<T>, typename Sz = Size<T>>
BinaryTreeNode<T> *Construct(It iterPreBegin, It iterInBegin, Sz n)
{
const auto rootValue = *iterPreBegin;
BinaryTreeNode<T> *pRoot = CreateTreeNode(rootValue);
Sz i = 0;
for (; i != n; i++)
{
if (*iterInBegin == rootValue)
{
break;
}
}
if (i == n)
{
return nullptr;
}
auto l = i;
auto r = n-i-1;
if (l != 0)
{
pRoot->m_pLeft = Construct<T, cItr<T>, Size<T>>(iterPreBegin+1, iterInBegin, l);
}
if (r != 0)
{
pRoot->m_pRight = Construct<T, cItr<T>, Size<T>>(iterInBegin+i+1, iterPreBegin+i+1, r);
}
return pRoot;
}
void Test()
{
// std::vector<int> vecPreOrder{1, 2, 4, 7, 3, 5, 6, 8};
// std::vector<int> vecInOrder{4, 7, 2, 1, 5, 3, 8, 6};
BinaryTreeNode<int> *pNode1 = CreateTreeNode(1);
BinaryTreeNode<int> *pNode2 = CreateTreeNode(2);
BinaryTreeNode<int> *pNode3 = CreateTreeNode(3);
BinaryTreeNode<int> *pNode4 = CreateTreeNode(4);
BinaryTreeNode<int> *pNode5 = CreateTreeNode(5);
BinaryTreeNode<int> *pNode6 = CreateTreeNode(6);
BinaryTreeNode<int> *pNode7 = CreateTreeNode(7);
BinaryTreeNode<int> *pNode8 = CreateTreeNode(8);
ConnectTreeNode(pNode1, pNode2, pNode3);
ConnectTreeNode(pNode2, pNode4, (BinaryTreeNode<int> *)nullptr);
ConnectTreeNode(pNode3, pNode5, pNode6);
ConnectTreeNode(pNode4, (BinaryTreeNode<int> *)nullptr, pNode7);
ConnectTreeNode(pNode6, pNode8, (BinaryTreeNode<int> *)nullptr);
vector<int> vecPreOrder;
PreOrder(pNode1, vecPreOrder);
cout << "---------------------------------Preorder---------------------------------" << endl;
for (const auto& value : vecPreOrder)
{
cout << value << ", ";
}
cout << endl;
vector<int> vecInOrder;
InOrder(pNode1, vecInOrder);
cout << "---------------------------------Inorder---------------------------------" << endl;
for (const auto& value : vecInOrder)
{
cout << value << ", ";
}
cout << endl;
BinaryTreeNode<int> *pBuildRoot = ConstructTree(vecPreOrder, vecInOrder);
vector<int>::iterator Pre = vecPreOrder.begin();vector<int>::iterator PreEnd = vecPreOrder.end();
vector<int>::iterator In = vecInOrder.begin();
PrintVector(vecInOrder);
//BinaryTreeNode<int> *pRet = Construct<int>(Pre, In);
}
int main()
{
Test();
return 0;
}