asha91

New Members
  • Content count

    3
  • Joined

  • Last visited

Community Reputation

0 Spren

About asha91

  1. A linear data structure gradually traverses the data elements, with just one data element immediately accessible. Examples include arrays and linked lists. However, This article(https://www.scaler.com/topics/non-linear-data-structure/) on the internet suggested that in a doubly linked list, there is no contiguous memory structure. All the elements of a LinkedList are spread across the memory in a Non-Linear fashion. We may access two data pieces by utilizing the previous and next pointers. So, is the doubly linked list a nonlinear data structure?
  2. I'm working on a software with two threads. one iteration of a circular linked list Because the linked list is circular, there is always a following member. another thread is changing the list However, I receive a concurrentModificationException. What am I supposed to do with it? Thanks