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

Inserting a new element at any position

The logic to insert an element in a circular linked list is the same as to insert an element in a normal linked list. The difference in the circular linked list is that we also need to link the last node's next reference to the head node. The following is the insert method for the CircularLinkedList class:

insert(element, index) {  if (index >= 0 && index <= this.count) {    const node = new Node(element);    let current = this.head;    if (index === 0) {      if (this.head == null) {        this.head = node; // {1}        node.next = this.head; // {2} NEW      } else {        node.next = current; // {3}        current = this.getElementAt(this.size()); // {4}        // update last element        this.head = node; // {5}        current.next = this.head; // {6} NEW      }
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