updated line 46 in Hashmap, lines 33-34 in 2-3 Tree, per feedback from Xiaochen

Author: joeyajames

2-3_tree.py

@@ -29,8 +29,6 @@ def _add(self, new_node):
 		self.child.extend(new_node.child)
 		if len(self.child) > 1:
 			self.child.sort()
-			for child in self.child:
-				child.parent = self
 		if len(self.data) > 2:
 			self._split()
 

HashMap.py

@@ -43,6 +43,7 @@ def delete(self, key):
 			if self.map[key_hash][i][0] == key:
 				self.map[key_hash].pop(i)
 				return True
+		return False
 
 	def print(self):
 		print('---PHONEBOOK----')