Skip to Content
Learning JavaScript Data Structures and Algorithms - Third Edition
book

Learning JavaScript Data Structures and Algorithms - Third Edition

by Loiane Avancini
April 2018
Beginner to intermediate content levelBeginner to intermediate
426 pages
10h 19m
English
Packt Publishing
Content preview from Learning JavaScript Data Structures and Algorithms - Third Edition

Creating the Deque class

As usual, we will start by declaring the Deque class and its constructor:

class Deque {  constructor() {    this.count = 0;    this.lowestCount = 0;    this.items = {};  }}

Since a deque is a special queue, we will notice that it shares some code snippets with the constructor, the same internal properties, and the following methods: isEmpty, clear, size, and toString.

Since the deque allows inserting and removing from both ends, we will also have the following methods:

  • addFront(element): This method adds a new element at the front of the deque
  • addBack(element): This method adds a new element at the back of the deque (same implementation as the enqueue method from the Queue class)
  • removeFront(): This method removes the first ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

Loiane Avancini

Publisher Resources

ISBN: 9781788623872Supplemental Content