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

Summary

In this chapter, we learned about the queue data structure. We implemented our own algorithm that represents a queue, and we learned how to add and remove elements from it using the enqueue and dequeue methods following the FIFO principle. We also learned about the deque data structure, how to add elements to the front and the back of the deque, and how to remove elements from the front or the back of the deque.

We also covered how to solve two famous problems using the queue and deque data structures: the Hot Potato game (using a modified queue: the circular queue) and a palindrome checker using a deque.

In the next chapter, we will learn about linked lists, a dynamic and more complex data structure.

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