Circularly Linked Lists

Article coming soon….

General brush stroke:

  -The great thing about circularly linked list is that it's circular.

  -Has only the tail pointer to keep track of the tails.

  -insertHead(), insertTail(), removeHead() are all O(1), using the rotate()method.

 -Never have to check for null because there's no null node. Saves a ton of overhead time complexity if processing millions or billions of data.

 -Applications? Music/Video playlists, CPU round robin time sharing.

  -Round Robin-time slice, creating the illusion of multitasking for single core CPU

  -How is CLL an improvement from the tranditional CPU scheduler?