@violangreg/

Data Structures: Queue Implementation-1

JavaScript

No description

fork
loading
main.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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
class Node {
  constructor(value) {
    this.value = value;
    this.next = null;
  }
}

class Queue {
  constructor(){
    this.first = null;
    this.last = null;
    this.length = 0;
  }
  peek() {
    return this.first;
  }
  enqueue(value){
    const node = new Node(value);
    if(this.length === 0){
      this.first = node;
      this.last = this.first;
    }
    else {
      this.last.next = node;
      this.last = node;
    }
    this.length++;
    return this;
  }
  dequeue(){
    if(this.first === null)
      return this;
    this.first = this.first.next;
    this.length--;
    if(this.first === null)
      this.last = null;
    return this;
  }
  //isEmpty;
}

const myQueue = new Queue();
myQueue.enqueue("Joy");
myQueue.enqueue("Matt");
myQueue.enqueue("Pavel");
myQueue.enqueue("Samir");
myQueue.peek();


//Joy
//Matt
//Pavel
//Samir

Native Browser JavaScript