Algoritms-DataStructures-JavaScript/17.Queue.js at main · evolurity/Algoritms-DataStructures-JavaScript · GitHub

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
class Node {
    constructor(data, next, prev) {
        this.data = data
        this.next = next
        this.prev = prev
    }
}

class Queue {
    constructor() {
        this.head = null
        this.tail = null
        this.length = 0
    }

    put(data) {
        if (!this.head) {
            this.tail = new Node(data, null, null)
            this.head = this.tail
            this.length++
        } else {
            const node = new Node(data, null, this.tail)
            this.tail.next = node
            this.tail = node
            this.length++
        }
    }

    pick() {
        if (!this.head) {
            this.tail = null
            return null
        }
        const newHead = this.head.next
        const deletedNodeData = this.head.data
        this.head.data = null
        this.head = newHead
        this.length--
        return deletedNodeData
    }

    toArray() {
        const array = []
        let current = this.head
        while (current) {
            array.push(current.data)
            current = current.next
        }
        return array
    }
}

const queue = new Queue()
queue.put('1')
queue.put('2')
console.log(queue);
console.log(queue.length);
queue.put(3)
queue.put(4)
queue.put(5)
console.log(queue);
console.log(queue.length);
console.log(queue.pick());
console.log(queue.pick());
console.log(queue.pick());
console.log(queue.pick());
console.log(queue.pick());
console.log(queue.pick());
console.log(queue.toArray())
queue.put(3)
queue.put(4)
queue.put(5)
console.log(queue);
console.log(queue.length);
console.log(queue.toArray())