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 the linked list from a specific position

Now, let's see how we can remove elements from the LinkedListWe are going to implement two methods: the first one removes an element from a specified position (removeAt), and the second one is based on the element value (we will present the remove method later). As in the case of the push method, there are two scenarios when removing elements from the linked list. The first scenario is removing the first element, and the second one is removing any element but the first one. 

The removeAt code is presented as follows:

removeAt(index) {  // check for out-of-bounds values  if (index >= 0 && index < this.count) { // {1}    let current = this.head; // {2}    //removing first item if (index ...
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