-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdatastruct
More file actions
175 lines (153 loc) · 5.58 KB
/
datastruct
File metadata and controls
175 lines (153 loc) · 5.58 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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
var dataStructures = {
node : function(data) {
this.data = data;
this.previous = null;
this.next = null;
},
linkedList : function() {
var first = null;
var last = null;
this.getFirst = function() {
return first;
};
this.getLast = function() {
return last;
};
this.insertFirst = function(value) {
var newNode = new dataStructures.node(value);
if (first === null) {
last = newNode;
} else {
first.previous = newNode;
newNode.next = first;
}
first = newNode;
};
this.insertLast = function(value) {
var newNode = new dataStructures.node(value);
if (last === null) {
first = newNode;
} else {
last.next = newNode;
newNode.previous = last;
}
last = newNode;
};
this.deleteFirst = function() {
if (first === null){
return false;
} else {
if (first.next === null) {
last = null;
} else {
first.next.previous = null;
}
first = first.next;
return true;
}
};
this.deleteLast = function() {
if (last === null) {
return false;
} else {
if (first.next === null) {
first = null;
} else {
last.previous.next = null;
}
last = last.previous;
return true;
}
};
this.insertAfter = function(key, value) {
if (first === null) {
return false;
}
var current = first;
while (current.data !== key) {
current = current.next;
if (current === null) {
return false;
}
}
var newNode = new dataStructures.node(value);
if (current === last) {
newNode.next = null;
last = newNode;
} else {
newNode.next = current.next;
current.next.previous = newNode;
}
newNode.previous = current;
current.next = newNode;
return true;
};
this.deleteKey = function(key) {
if (first === null) {
return false;
}
var current = first;
while (current.data !== key) {
current = current.next;
if (current === null) {
return false;
}
}
if (current === first) {
first = current.next;
} else {
current.previous.next = current.next;
}
if (current === last) {
last = current.previous;
} else {
current.next.previous = current.previous;
}
return true;
};
this.traverseForwards = function(callback) {
var current = first;
while (current) {
callback(current);
current = current.next;
}
};
this.traverseBackwards = function(callback) {
var current = last;
while (current) {
callback(current);
current = current.previous;
}
}
},
stack : function() {
var elements;
this.push = function(element) {
if (typeof(elements) === 'undefined') {
elements = [];
}
elements.push(element);
}
this.pop = function() {
return elements.pop();
}
this.stackTop = function(element) {
return elements[elements.length - 1];
}
},
queue : function() {
var elements;
this.enqueue = function(element) {
if (typeof(elements) === 'undefined') {
elements = [];
}
elements.push(element);
}
this.dequeue = function() {
return elements.shift();
}
this.peek = function(){
return elements[0];
}
}
};