Algorithms and data structures for JS/TS
  • Introduction
  • GETTING STARTED
    • TS
    • Node.js
    • ES Modules
    • Browsers
  • PUBLIC API
    • How to read
    • Linked lists
      • SinglyLinkedList
      • DoublyLinkedList
      • CircularlyLinkedList
    • Stacks and queues
      • LinkedStack
      • LinkedQueue
      • LinkedDeque
      • CircularQueue
      • CircularArrayBuffer
      • UnsortedPriorityQueue
      • SortedPriorityQueue
      • AdaptableHeapPriorityQueue
    • Maps
      • SortedMap
      • MaximaSet
      • AVLTreeMap
      • SplayTreeMap
      • RedBlackTreeMap
    • Trees
      • GeneralTree
      • LinkedBinaryTree
      • PreorderTreeTraversal
      • InorderTreeTraversal
      • PostorderTreeTraversal
      • EulerTourTreeTraversal
    • Searches
      • Binary search
      • Quick select
    • Text processing
      • Longest common subsequence
      • Boyer-Moore
      • Knuth-Morris-Pratt
    • Position
    • Locator
    • Comparators
  • CONTRIBUTION NOTES
    • How to contribute
    • Project structure
  • Changelog
Powered by GitBook
On this page

Was this helpful?

  1. PUBLIC API

Linked lists

PreviousHow to readNextSinglyLinkedList

Last updated 5 years ago

Was this helpful?

Import alias 'ads-js/lists'

Linear data structures in which elements are linked using pointers.

These lists are implemented in positional manner. This means you can store references to certain list nodes to access them in constant time and be sure that you won't shot yourself in foot by getting too much access to list internals.

Table of contents

- positional linked list with elements linked in one direction from head to tail.

- positional linked list with elements linked in both directions from head to tail and vice versa.

- positional linked list with elements linked in one direction from head to tail and tail linked to head.

SinglyLinkedList
DoublyLinkedList
CircularlyLinkedList