We have used the node structure and a linked-list structure as shown below:
Class Node:
def __init__(self,initdata):
self.data = initdata
self.next = none
Class OrderedList:
def __init__(self):
self.head = None
For an ordered linked-list, write an algorithm called count which will count the number of occurrences of a specific piece of data. First, you have to create the linked list using the following input (note: this should be an ordered list - how will we do this?).
2, 5, 10, 14, 18, 23, 23, 23, 25, 26, 29, 31, 35, 37.
Next , think about how we will count the duplicates (pseudocode: 5 points, Python code: 15 points)? The functions you will need are given in the book and on CANVAS (code 3.21a).