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

Compare commits

base: schoeffelbe82781:141ff08b8215f35f26eccb77f25417d071f93410
Branches Tags
schoeffelbe82781:main
schoeffelbe82781:be/pr10
schoeffelbe82781:be/pr09
schoeffelbe82781:be/pr08
schoeffelbe82781:be/pr07
schoeffelbe82781:be/pr05
schoeffelbe82781:be/pr03
hofmannol:main
..
compare: schoeffelbe82781:c3826412343df03680b8edc36941849c308aa027
Branches Tags
schoeffelbe82781:main
schoeffelbe82781:be/pr10
schoeffelbe82781:be/pr09
schoeffelbe82781:be/pr08
schoeffelbe82781:be/pr07
schoeffelbe82781:be/pr05
schoeffelbe82781:be/pr03
hofmannol:main

No commits in common. "141ff08b8215f35f26eccb77f25417d071f93410" and "c3826412343df03680b8edc36941849c308aa027" have entirely different histories.
141ff08b82 ... c382641234

1 changed files with 5 additions and 7 deletions
Show Stats Expand all files Collapse all files

12
vorlesung/L05_binaere_baeume/bin_tree.py
View File

@ -40,11 +40,10 @@ 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: if value < current.value:
current = current.left current = current.left
elif value > current: elif value > current.value:
current = current.right current = current.right
else: else:
return current return current
@ -56,12 +55,11 @@ 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: if value < current.value:
parent = current parent = current
current = current.left current = current.left
elif value > current: elif value > current.value:
parent = current parent = current
current = current.right current = current.right
else: else:
@ -100,7 +98,7 @@ class BinaryTree:
if not parent: if not parent:
self.root = child self.root = child
return child, None return child, None
elif parent.left is current: elif parent.left == current:
parent.left = child parent.left = child
return child, parent return child, parent
else: else: