Python Can you explain the code with comments? class linkedList():     class _Node:         def __init__(self, value, next = None):             self._data = value             self._next = next         def get_data(self):             return self._data         def set_data(self, value):             self._data = value         def get_next(self):             return self._next         def set_next(self, nodetopoint = None):             self._next =  nodetopoint     def __init__(self):         self.head = None         self.size = 0     def insertNode(self, pos, value):         # Add a new node with data set to the value parameter at position pos of list. The first item is at position 0. When pos > size, insert at the end of the list.                  #######################################################################         # Remove the pass statement and write your code         #######################################################################         pass          def deleteValue(self, value):         # Deletes the first node from the linked list for which the data is same as the value                  #######################################################################         # Remove the pass statement and write your code         #######################################################################         pass          def deletePosition(self, index):         # Deletes the node at postion index from the linked list. The first item is at index 0.                   #######################################################################         # Remove the pass statement and write your code         #######################################################################         pass     def deleteAll(self):         # Deletes all nodes from the linked list.          #######################################################################         # Remove the pass statement and write your code         #######################################################################         pass     def getSize(self):         # Returns the size of the linkedlist and for empty linkedlist returns 0         #######################################################################         # Remove the pass statement and write your code         #######################################################################         pass     def printList(self):          # Prints the data stored in all the items of the linked list.          # Sample output1: head -> None         # Sample output2: head -> 100 -> 15 -> None         #######################################################################         # Remove the pass statement and write your code         #######################################################################         pass

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Python

Can you explain the code with comments?

class linkedList():
    class _Node:
        def __init__(self, value, next = None):
            self._data = value
            self._next = next

        def get_data(self):
            return self._data

        def set_data(self, value):
            self._data = value

        def get_next(self):
            return self._next

        def set_next(self, nodetopoint = None):
            self._next =  nodetopoint

    def __init__(self):
        self.head = None
        self.size = 0

    def insertNode(self, pos, value):
        # Add a new node with data set to the value parameter at position pos of list. The first item is at position 0. When pos > size, insert at the end of the list.
        
        #######################################################################
        # Remove the pass statement and write your code
        #######################################################################
        pass
    
    def deleteValue(self, value):
        # Deletes the first node from the linked list for which the data is same as the value
        
        #######################################################################
        # Remove the pass statement and write your code
        #######################################################################
        pass
    
    def deletePosition(self, index):
        # Deletes the node at postion index from the linked list. The first item is at index 0. 
        
        #######################################################################
        # Remove the pass statement and write your code
        #######################################################################
        pass

    def deleteAll(self):
        # Deletes all nodes from the linked list. 
        #######################################################################
        # Remove the pass statement and write your code
        #######################################################################
        pass

    def getSize(self):
        # Returns the size of the linkedlist and for empty linkedlist returns 0
        #######################################################################
        # Remove the pass statement and write your code
        #######################################################################
        pass

    def printList(self): 
        # Prints the data stored in all the items of the linked list. 
        # Sample output1: head -> None
        # Sample output2: head -> 100 -> 15 -> None

        #######################################################################
        # Remove the pass statement and write your code
        #######################################################################
        pass

Expert Solution
Step 1

The code is given below for the commented methods or functions

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Operations of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education