mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Typo? (#1653)

Browse Source 
* Typo?

newNod -> newNode

* newNode -> new_node

Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
Logan Lieou 2020-01-14 03:21:02 -06:00 committed by Christian Clauss
parent 56e7ae01d2
commit d09a805804
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/linked_list/singly_linked_list.py
View File

@ -21,10 +21,10 @@ class LinkedList:
temp.next = Node(data) # create node & link to tail temp.next = Node(data) # create node & link to tail
def insert_head(self, data) -> None: def insert_head(self, data) -> None:
newNod = Node(data) # create a new node new_node = Node(data) # create a new node
if self.head: if self.head:
newNod.next = self.head # link newNode to head new_node.next = self.head # link new_node to head
self.head = newNod # make NewNode as head self.head = new_node # make NewNode as head
def print_list(self) -> None: # print every node data def print_list(self) -> None: # print every node data
temp = self.head temp = self.head