-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathMultiLevelLinkedList.cpp
122 lines (80 loc) · 2.45 KB
/
MultiLevelLinkedList.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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// Original code based on the input and output from the task given
// Structure of the Data Struct
struct Node {
char name[50];
struct Node* next;
struct Node* subordinate;
};
// creteNode Function
struct Node* createNode(const char* name) {
struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
if (newNode != NULL) {
strcpy(newNode->name, name);
newNode->next = NULL;
newNode->subordinate = NULL;
}
return newNode;
}
// addSubordinate Function
void addSubordinate(struct Node* manager, const char* subordinateName) {
struct Node* subordinate = createNode(subordinateName);
if (subordinate != NULL) {
subordinate->next = manager->subordinate;
manager->subordinate = subordinate;
}
}
// printSubordinates function for the recursion
void printSubordinates(struct Node* subordinate) {
if (subordinate == NULL) {
printf ("NULL");
return;
}
printf("%s -> ", subordinate->name);
printSubordinates(subordinate->next);
}
// The printList function which call the recursion function
void printList(struct Node* manager) {
if (manager == NULL) {
return;
}
printf("Subordinate of %s: ", manager->name);
printSubordinates(manager->subordinate);
printf("\n");
struct Node* subordinate = manager->subordinate;
while (subordinate != NULL) {
printList(subordinate);
subordinate = subordinate->next;
}
}
// The fireAll function that free all of the organizational hierachy
void fireAll(struct Node** ceoPtr) {
struct Node* current = *ceoPtr;
if (current == NULL) {
return;
}
fireAll(&(current->subordinate));
fireAll(&(current->next));
free(current);
// Make all of the value equal to NULL
*ceoPtr = NULL;
}
// main function
int main() {
struct Node* ceo = createNode ("Frieren");
addSubordinate (ceo, "Eisen");
addSubordinate (ceo, "Heiter");
struct Node* manager1 = ceo->subordinate;
addSubordinate (manager1, "Stark");
struct Node* manager2 = ceo->subordinate->next;
addSubordinate (manager2, "Fern");
printf("Organizational Hierarchy:\n\n");
printList(ceo);
// Need the address to make it NULL
fireAll(&ceo);
// Check whether the linked list is empty after calling fireAll function
printList(ceo);
return 0;
}