-
Notifications
You must be signed in to change notification settings - Fork 0
/
BookTree.cpp
79 lines (64 loc) · 2.21 KB
/
BookTree.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
#include<bits/stdc++.h>
using namespace std;
struct node {
string label;
int count;
node *child[10];
} *root;
class Book {
public:
Book() {
root = NULL;
}
void create() {
root = new node;
cout << "\n Enter the name of the book: ";
cin >> root->label;
cout << "\n Enter the number of chapters: ";
cin >> root->count;
for (int i = 0; i < root->count; i++) {
root->child[i] = new node;
cout << "\n Enter the name of the " << i + 1 << " chapter: ";
cin >> root->child[i]->label;
cout << "\n Enter the number of sections: ";
cin >> root->child[i]->count;
for (int j = 0; j < root->child[i]->count; j++) {
root->child[i]->child[j] = new node;
cout << "\n Enter the name of the " << j + 1 << " section: ";
cin >> root->child[i]->child[j]->label;
cout << "\n Enter the number sub sections: ";
cin >> root->child[i]->child[j]->count;
for (int k = 0;
k < root->child[i]->child[j]->count; k++) {
root->child[i]->child[j]->child[k] = new node;
cout << "\n Enter the name of the " << k + 1 << " sub section: ";
cin >> root->child[i]->child[j]->child[k]->label;
}
}
}
}
void display() {
cout << "\n Name of the book is: ";
cout << root->label;
cout << "\n Name of the chapter and the sections is: ";
for (int i = 0; i < root->count; i++) {
cout << i + 1 << " " << root->child[i]->label << endl;
node *temp;
temp = root->child[i];
for (int j = 0; j < temp->count; j++) {
node *temp2;
temp2 = root->child[i]->child[j];
cout << i + 1 << " " << root->child[i]->child[j]->label << endl;
for (int k = 0; k < temp2->count; k++) {
cout << i + 1 << " " << root->child[i]->child[j]->child[k]->label << endl;
}
}
}
}
};
int main() {
Book o;
o.create();
o.display();
return 0;
}