Both array-based sequences and linked lists keep elements in a certain order, but using a very different style.

Lists are ….whereas arrays are …

Each node has at least a single pointer to the next node

The last element points to NULL

connected by pointers and can grow or shrink

Arrays waste memory in terms of extra reference points. Linked lists waste memory by allocating lots of space initially.

search(item) searches for the item in the list. It needs the item and returns the item

List() creates a new list that is empty. It needs no parameters and returns an empty list

Generally "linked list" means a doubly linked list.

in linked list “head” must be … specified

Each node contains the list item’s data itself + a reference to the next node

in linked list The …. of the list refers to the first node which contains the first item of the list

the special reference “None” will again be used to state that the head of the list does not refer to anything.

The result of the Boolean expression self.head==None will only be true if there are no nodes in the linked list.

The search() Method

List Traversal

The search() Method