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

Removing elements from any position

Removing elements from a doubly linked list is also very similar to a linked list. The only difference is that we need to set the previous pointer as well. Let's take a look at the implementation:

removeAt(index) {  if (index >= 0 && index < this.count) {    let current = this.head;    if (index === 0) {      this.head = current.next; // {1}      // if there is only one item, then we update tail as well NEW      if (this.count === 1) { // {2}         this.tail = undefined;      } else {        this.head.prev = undefined; // {3}      }    } else if (index === this.count - 1) { // last item NEW      current = this.tail; // {4}      this.tail = current.prev; // {5}      this.tail.next = undefined; // {6}    } else {      current = this.getElementAt(index); // {7} const previous ...
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