forked from loiane/javascript-datastructures-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path03-CircularLinkedList.js
32 lines (22 loc) · 1.08 KB
/
03-CircularLinkedList.js
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
const { CircularLinkedList } = PacktDataStructuresAlgorithms;
const list = new CircularLinkedList();
console.log('push element 15');
list.push(15);
console.log('list.toString() => ', list.toString());
console.log('push element 16');
list.push(16);
console.log('list.toString() => ', list.toString());
console.log('insert element 14 pos 0 => ', list.insert(14, 0));
console.log('list.toString() => ', list.toString());
console.log('insert element 14.5 pos 1 => ', list.insert(14.5, 1));
console.log('list.toString() => ', list.toString());
console.log('insert element 17 pos 4 => ', list.insert(17, 4));
console.log('list.toString() => ', list.toString());
console.log('list.removeAt(0) => ', list.removeAt(0));
console.log('list.toString() => ', list.toString());
console.log('list.removeAt(1) => ', list.removeAt(1));
console.log('list.toString() => ', list.toString());
console.log('list.removeAt(2) => ', list.removeAt(2));
console.log('list.toString() => ', list.toString());
console.log('list.indexOf(14.5) => ', list.indexOf(14.5));
console.log('list.indexOf(16) => ', list.indexOf(16));