Pyhton..

Package the implementation provided in Listing 6.10 (on page 171 in your book) for inserting a value into a sorted linked list into a function

def insert_node( value, head ):

where value specifies the value to be stored with the new node and head is the reference to the first node in the linked list.

First, you must build a linked list either using a linked list implementation or manually.

Demonstrate with several examples that the function behaves as expected. Duplicating the scenario provided in the book is one possible way to demonstrate that the code works. However, you should think of providing additional examples.

6 7 Listing 6.10 Inserting a value into a sorted list. 1 # Given the head pointer, insert a value into a sorted linked list. 2 # Find the insertion point for the new value. 3 predNode = None 4 curNode = head 5 while curNode is not None and value > curNode.data : predNode = curNode curNode = curNode. next 8 # Create the new node for the new value. 10 newNode = ListNode( value ) 11 newNode. next = curNode # Link the new node into the list. 13 if curNode is head : head = newNode 15 else: predNode. next = newNode 9 12 14 16