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

Peeking the top of the stack and clearing it

In the last section, we learned that, in order to access the element that is stored at the top of the stack, it is necessary to decrement the count property by 1. So let's see the code for the peek method:

peek() {  if (this.isEmpty()) {    return undefined;  }  return this.items[this.count - 1];}

And to clear the stack, we can simply reset it to the same values we used in the constructor:

clear() {  this.items = {};  this.count = 0;}

We could also use the following logic to remove all elements from the stack, respecting the LIFO behavior:

while (!this.isEmpty()) {  this.pop();}
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