We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9b287d7 commit 2762ea6Copy full SHA for 2762ea6
03. Data Structures/Linked Lists/Implementation.py
@@ -49,7 +49,7 @@ def append(self, data):
49
self.length += 1
50
51
52
-#Next operation we'll implement is prepend, wehre we add a node at the head of the list.
+#Next operation we'll implement is prepend, where we add a node at the head of the list.
53
#For this, we will call the prepend method and pass the value we want to enter, which will create a new object of the node class
54
#Then we will make the 'next' of the new node point to the head ,as the head is currently pionting to the first node of the list
55
#And then we will update the head to point to new node as we want the new node to be new first node, i.e, the new head.
0 commit comments