reading-notes

View project on GitHub

Read: Linked Lists

Linked Lists

  • A Linked List A data structure that contains nodes that links to the next node in the list.
  • Linked List types are - Singly and Doubly.
  • Singly linked list allows traversal elements only in one way.
  • Doubly linked list allows element two way traversal.
  • Node properties are: Next / Head/ Current.

What’s a Linked List,PT1

Linear versus non-linear data structures

Memory allocation

Parts of a linked list

  • In Circular linked list all nodes are connected as a circle, so, There is no NULL at the end.

What’s a Linked List,PT2

  • There are two major points to consider when thinking about how an algorithm performs: how much time it requires at runtime given how much time and memory it needs.

  • Big O notation is a way to express the amount of time that a function, action, or algorithm takes to run based on how many elements we pass to that function.

Basic Big O Notation Equations

Arrays Vs. Linked List