Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Learning JavaScript Data  Structures and Algorithms

You're reading from   Learning JavaScript Data Structures and Algorithms Write complex and powerful JavaScript code using the latest ECMAScript

Arrow left icon
Product type Paperback
Published in Apr 2018
Publisher Packt
ISBN-13 9781788623872
Length 426 pages
Edition 3rd Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Loiane Avancini Loiane Avancini
Author Profile Icon Loiane Avancini
Loiane Avancini
Arrow right icon
View More author details
Toc

Table of Contents (17) Chapters Close

Preface 1. JavaScript – A Quick Overview FREE CHAPTER 2. ECMAScript and TypeScript Overview 3. Arrays 4. Stacks 5. Queues and Deques 6. Linked Lists 7. Sets 8. Dictionaries and Hashes 9. Recursion 10. Trees 11. Binary Heap and Heap Sort 12. Graphs 13. Sorting and Searching Algorithms 14. Algorithm Designs and Techniques 15. Algorithm Complexity 16. Other Books You May Enjoy

Circular linked lists

A circular linked list can have only one reference direction (as with a linked list) or a double reference (as with a doubly linked list). The only difference between a circular linked list and a linked list is that the last element's next (tail.next) pointer does not make a reference to undefined, but to the first element (head), as we can see in the following diagram:

A doubly circular linked list has tail.next pointing to the head element, and head.prev pointing to the tail element:

Let's check the code to create the CircularLinkedList class:

CircularLinkedList extends LinkedList {
constructor(equalsFn = defaultEquals) {
super(equalsFn);
}
}

The CircularLinkedList class does not need any additional properties, so we can simply extend the LinkedList class and overwrite the required methods to apply the special behavior.

We will overwrite...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime