vorlesung/L05_binaere_baeume/bin_tree.py

@@ -40,11 +40,10 @@ class BinaryTree:
 
     def search(self, value):
         current = self.root
-        value = self.new_node(value)
         while current:
-            if value < current:
+            if value < current.value:
                 current = current.left
-            elif value > current:
+            elif value > current.value:
                 current = current.right
             else:
                 return current
@@ -56,12 +55,11 @@ class BinaryTree:
         # der Knoten, der den zu löschenden Knoten ersetzt und der Elternknoten des gelöschten Knotens
         parent = None
         current = self.root
-        value = self.new_node(value)
         while current:
-            if value < current:
+            if value < current.value:
                 parent = current
                 current = current.left
-            elif value > current:
+            elif value > current.value:
                 parent = current
                 current = current.right
             else:
@@ -100,7 +98,7 @@ class BinaryTree:
         if not parent:
             self.root = child
             return child, None
-        elif parent.left is current:
+        elif parent.left == current:
             parent.left = child
             return child, parent
         else: