Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Learning JavaScript Data Structures and Algorithms
  • Table Of Contents Toc
Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms - Fourth Edition

By : Loiane Groner, Aris Markogiannakis, Daniel Ostrovsky
close
close
Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

By: Loiane Groner, Aris Markogiannakis, Daniel Ostrovsky

Overview of this book

Data structures and algorithms are foundational topics for software developers. This easy-to-follow book from experienced developer and trainer Loiane Groner will help you to fill in the gaps in your knowledge – whether you’re a self-taught developer, you’re preparing for technical interviews, or you just want to write better code and improve your problem-solving skills. This fourth edition covers essential data structures, algorithms, and their usage in the context of JavaScript. You’ll follow examples in both JavaScript and TypeScript, in line with the latest standards and best practices, learning how to do complexity analysis along the way. New to this edition are LeetCode and HackerRank exercises at the end of each chapter, which you'll be guided through solving. You’ll also find brand-new chapters on the tries data structure, and string and math algorithms. By the end of the book, you will know how to develop programs using the best data structures and algorithms for the job.
Table of Contents (9 chapters)
close
close
Lock Free Chapter
1
Learning JavaScript Data Structures and Algorithms, Fourth Edition: Enhance your problem-solving skills in JavaScript and TypeScript

6 Linked Lists

Before you begin: Join our book community on Discord

Give your feedback straight to the author himself and chat to other early readers on our Discord server (find the "learning-javascript-dsa-4e" channel under EARLY ACCESS SUBSCRIPTION).

https://packt.link/EarlyAccess/

In previous chapters, we explored data structures stored sequentially in memory. Now, we turn our attention to linked lists, a dynamic and linear data structure with a non-sequential memory arrangement. This chapter delves into the inner workings of linked lists, covering:

  • The linked list data structure
  • Techniques for adding and removing elements from linked lists
  • Variations of linked lists: doubly linked lists, circular linked lists and sorted linked lists
  • How linked lists can be used to implement other data structures
  • Implementing other data structures with linked lists
  • Exercises using linked lists

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon