schoeffelbe82781/AlgoDatSoSe25
1
0
Fork 0
forked from hofmannol/AlgoDatSoSe25
Code Pull Requests Activity

merge upstream

Browse Source
This commit is contained in:
Bernhard Schoeffel 2025-04-24 12:33:06 +00:00
commit 141ff08b82
1 changed files with 7 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
vorlesung/L05_binaere_baeume/bin_tree.py
View File

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