const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

Methods

addBack(element)

queue/deque.js, line 51

Adds a element at the back of the DEQUE

Parameters:

Name	Type	Description
element	*	Element passed to insert

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.addBack(87); //inserts 87 at the back of the deque

addFront(element)

queue/deque.js, line 27

Adds a element at the front of the DEQUE

Parameters:

Name	Type	Description
element	*	Element passed to insert

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.addFront(55); //inserts 55 at the front of the deque

back() → {*}

queue/deque.js, line 121

Returns the element at the back of DEQUE

Returns:

* -

The element at the back

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.addFront(6); 
deque.addBack(3);

deque.back(); //returns 3;

clear()

queue/deque.js, line 168

Resets the DEQUE data-structure

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.addFront(15);
deque.addBack(9);

deque.clear(); // now deque is empty

front() → {*}

queue/deque.js, line 105

Returns the element at the front of DEQUE

Returns:

* -

The element at the front

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.addFront(6); 
deque.addBack(3);

deque.front(); //returns 6;

isEmpty() → {Boolean}

queue/deque.js, line 138

Returns if the DEQUE data-structure is empty

Returns:

Boolean

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.isEmpty(); // returns true;

deque.addBack(23);

deque.isEmpty(); //returns false;

removeBack()

queue/deque.js, line 85

Removes an element from the end of the DEQUE

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.addFront(59); 
deque.addFront(14);

deque.removeBack(); //removes 59 from the deque

removeFront()

queue/deque.js, line 66

Removes an element from the beginning of the DEQUE

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.addFront(59); 
deque.addFront(14);

deque.removeFront(); //removes 14 from the deque

size() → {Number}

queue/deque.js, line 154

Returns the size of the DEQUE data-structure

Returns:

Number -

The number of elements in the DEQUE

Example

const { Deque } = require('data-structures-algorithms-js');
const deque = new Deque();

deque.size(); // returns 0;

deque.addFront(8);

deque.size(); //returns 1;