0 / 0 / 0
Регистрация: 12.10.2014
Сообщений: 12
|
|
|
1
|
Деревья (нужны комментарии)
16.12.2015, 16:09. Показов 390. Ответов 0
Помогите понять программу, если можете то опишите комментариями рядом, что и зачем)буду очень благодарна)
| C++ | 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
| #include <iostream>
#include <conio.h>
#include <string>
using namespace std;
struct Node
{
string data;
Node *right, *left;
};
void Creation(string tree_line, Node *MyTree)
{
MyTree->data = tree_line[0];
tree_line.erase(0, 1);
if(!tree_line.empty())
{
MyTree->left = new Node;
MyTree->right = new Node;
Creation(tree_line, MyTree->left);
Creation("*", MyTree->right);
}
else
{
MyTree->left = NULL;
MyTree->right = NULL;
}
}
void Prefix(Node *MyTree)
{
if(MyTree != NULL)
{
cout << MyTree->data;
Prefix(MyTree->left);
Prefix(MyTree->right);
}
}
void Infix(Node *MyTree)
{
if(MyTree != NULL)
{
Infix(MyTree->left);
cout << MyTree->data;
Infix(MyTree->right);
}
}
void Postfix(Node *MyTree)
{
if(MyTree != NULL)
{
Postfix(MyTree->left);
Postfix(MyTree->right);
cout << MyTree->data;
}
}
void Show(Node *MyTree, int n)
{
if(MyTree == NULL)
return;
else
{
Show(MyTree->left, ++n);
for(int i = 0; i < n; i++)
cout << "|";
cout << MyTree->data << endl;
n--;
}
Show(MyTree->right, ++n);
}
void main()
{
string tree_line;
Node *Tree = new Node;
cout << "Vvedite stroku: ";
getline(cin, tree_line);
Creation(tree_line, Tree);
cout << "\n";
Show(Tree, 0);
cout << "\nPrefix ";
Prefix(Tree);
cout << "\nInfix ";
Infix(Tree);
cout << "\nPostfix ";
Postfix(Tree);
cin.get();
} |
|
0
|
(
