-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedList.cpp
More file actions
118 lines (72 loc) · 1.59 KB
/
LinkedList.cpp
File metadata and controls
118 lines (72 loc) · 1.59 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
118
#include <iostream>
#include <cstdlib>
#include <cmath>
#include "LinkedList.h"
using namespace std;
LLNode * createLLNode (string name, int rating) {
LLNode * newLLNode;
newLLNode = new LLNode;
newLLNode->name = name;
newLLNode->rating=rating;
newLLNode->next = NULL;
return newLLNode;
}
int sizeRatings (LLNode * top) {
if(top==NULL){
return 0;
}
return 1+ sizeRatings(top->next);
}
LLNode * insertRating (LLNode * top, string name, int rating) {
if(top==NULL || top->rating <=rating){
LLNode * newLLNode = createLLNode(name,rating);
newLLNode->next=top;
return newLLNode;
}
top->next=insertRating(top->next, name, rating);
return top;
}
LLNode * deleteRating (LLNode * top, string name) {
if(top==NULL){
return NULL;
}
if(top->name==name){
LLNode * curr = top;
top=top->next;
delete curr;
return top;
}
top->next=deleteRating(top->next, name);
return top;
}
void displayRatings (LLNode * top) {
if(top==NULL){
return;
}
cout << top->name << " " << top->rating << endl;
displayRatings(top->next);
}
LLNode * findRating (LLNode * top, string name) {
if(top==NULL){
return NULL;
}
if(top->name==name){
return top;
}
return findRating(top->next,name);
}
int averageRating (LLNode * top) {
int sum=0;
int num=0;
if(top==NULL){
return 0;
}
while(top!=NULL){
sum+=top->rating;
top=top->next;
num++;
}
float average=(sum*1.0)/num;
int avg=round(average);
return avg;
}