-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPrintTreeStructure.h
53 lines (50 loc) · 1.17 KB
/
PrintTreeStructure.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
#include <iostream>
using namespace std;
void printTreeStructure(vector<vector<int>> tree)
{
for (int i = 0; i < tree.size(); i++) {
for (int j = 0; j < tree[i].size(); j++) {
if(j == tree[i].size()-1)
{
cout << tree[i][j];
}
else
{
cout << tree[i][j] << "*";
}
}
cout << endl;
}
}
void printTreeStructure_right(vector<vector<int>> tree)
{
for (int i = 0; i < tree.size(); i++) {
for (int j = 0; j < tree[i].size(); j++) {
if(j == tree[i].size()-1)
{
cout << tree[i][j];
}
else
{
cout << tree[i][j] << "*";
}
}
cout << "-1" << endl;
}
}
void printTreeStructure_left(vector<vector<int>> tree)
{
for (int i = 0; i < tree.size(); i++) {
for (int j = 0; j < tree[i].size(); j++) {
if(j == tree[i].size()-1)
{
cout << tree[i][j];
}
else
{
cout << tree[i][j] << "*";
}
}
cout << "+1" << endl;
}
}