Arete Zafiriou - Student.cs.uwaterloo.ca

More documents

Recommendations

Info

head – reference to the first node in the list tail – last node in the list link in the tail is a None reference Most nodes have no names or references. They are referenced by the link in the preceding node. Head – should be referenced by an external variable - entry point to the list - null head reference indi<strong>ca</strong>tes an empty list The Basic operations 1. List traversal 2. Search for an item 3. Insert an item 4. Delete an item … Traversing a List curNode 9 17 52 4 We <strong>ca</strong>n traverse this list by creating a temporary reference curNode = head 9 14 17 52 create a linked list LL = Node(9, Node(14,Node(17,Node(52,None)))) N = Node(23) 23 Traverse the list by advancing the temporary reference curNode = curNode._next Repeat again
Until Curnode == None, you have reached the end of the list 23 9 14 17 Searching for an item in SLL Traverse the list Produce true if the item is in the list Produce false otherwise Inserting items in a SLL Insert(27) Node 17 head Beginning of the list head New node 27 17 newNode._next = head head = newNode 1. newNode._next=head head = newNode 2. head=newNode newNode._next = head Inserting in the middle of the list 9 17 14 52 1 2 curNode 27 newNode
Page 1: CS 234 - Lecture #8 May 30,2013 Lin
Page 5: Python List __getItem__(self,index)

Arete Zafiriou - Student.cs.uwaterloo.ca

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?