stephengrice / education Goto Github PK

Seems python does not have C++ reference concept. When I get a node and want to modify its value, only a node copy's value is changed. Original hash table's content remains the same.

I need to traverse the whole table and for certain node, if necessary I'll change's value. To go through all node, I need to call node=node.next which means I can't delete a node and insert with new value again?

I have understood your singly linked list code and it clean and clear and it would be helpful if you could post a double linked list code.

I ran the code on python 3.6. However, the find method for a key is still returning it's value even after removing the key( using remove method) on the previous line of code.

d = HashTable()
d.insert('A', 5)
d.insert('B', 10)
d.insert('Ball', 'hello')

print(d.remove('A'))
print(d.remove('A'))
print(d.find('A'))

this is giving the value for the key 'A' all three times. Instead of printing None for the last 2 lines

From Hisao in YouTube comments. Great catch.
Add self.size += 1 before returning True in LinkedList.add_at