Reading notes for Code Fellows!
There are two types of linked lists - ____ and ____.
A linked list is a sequence of ____ that are connected/linked to each other.
The starting point of a list is the first node, referred to as the ____.
When traversing a linked list, you are not able to use a ____ or for loop.
The ____ property is exceptionally important. It will lead to where the next node is.
When adding a node to the middle of a linked list use either an ____ or an ____ method.
The best way to traverse a linked list is the use of a ____ loop.
When making a linked list, make sure one node is passed in on instantiation. It will be what the ____ and ____ will point to.
Linked lists are ____ data structures. Meaning they are constructed and traversed sequentially.
The fundamental difference between arrays and linked lists is that arrays are ____ data structures, while linked lists are ____ data structures.
A single node within a linked list has just two parts: __ that the node contains, and a reference to the ____.
Both singly and doubly linked lists can be be turned into ____ linked lists, which are traversed, starting from the ____.
Big O Notation is used to evaluate the __ and __ complexity of an algorithm based on its inputs.
A Big O equation which takes constant time, is __.
__ is a Big O equation which is linear.