What is a linked list? a series of Nodes that reference each other
node with only 1 reference, to the next nodenode looked at. usually this is reset during traversal, set the head to the currentforeach or for, you need to use nextwhile() for traversal, can keep seeing if next node is null. if you go to a null node, NullReferenceException gets thrown and program will crashcurrent is the most useful to help show where you are in listincludes is O(n), becaus the last node is what we want. n is the number of nodes in listincludes is O(1), no additional space is used[chunk of data] link to next node ->Big O Notation is about efficiency and tradeoffs.
O(n^2) is exponential growth
current, change head pointer to new Nodeadding to the end is O(n)