Linked lists

- [Instructor] The next data structure…that we're going to examine is the linked list.…A linked list is a linear collection of data elements…which are sometimes called nodes.…So this is sort of like an array,…but a little bit different.…Each of these nodes have a field…that points to the next element in the list.…And each of these elements can contain…whatever information your app needs to work with.…So conceptually, a linked list looks like this…and in this case, the nodes contain integer numbers…as their data.…

The first item in the list is called the head.…And each element has a field…that refers to the next item in the list.…The last item in the list has a field…that points to nothing,…which indicates that it is the end of the list.…In this particular case,…the diagram you see here represents…what's called a singly-linked list.…It's called that because there's only one direction…of links provided,…that is, each item only knows about its next neighbor.…But there's no reason we couldn't have a doubly linked list,…