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

Removed no longer needed function, cleaned up structure

Browse Source
This commit is contained in:
Bernhard Schoeffel 2025-04-23 10:45:53 +02:00
parent d8a9b29a69
commit b12e39952d
1 changed files with 2 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
schoeffelbe/pr04.py
View File

@ -174,21 +174,6 @@ class BinaryTree:
self.root = _insert(self.root, value)
def preOrder(self, node : BinaryTreeNode):
if node is None:
return []
return [str(node)] + self.preOrder(node.left) + self.preOrder(node.right) # type: ignore -> Ignoring pywright errors
def inOrder(self, node : BinaryTreeNode):
if node is None:
return []
return self.inOrder(node.left) + [str(node)] + self.inOrder(node.right) # type: ignore -> Ignoring pywright errors
def postOrder(self, node : BinaryTreeNode):
if node is None:
return []
return self.postOrder(node.left) + self.postOrder(node.right) + [str(node)] # type: ignore -> Ignoring pywright errors
def traverse(self, mode="in", visual=False):
mode = mode.lower()
# Have internal depth counting
@ -205,22 +190,18 @@ class BinaryTree:
connector = "+-- " if is_left else "L-- "
line = prefix + connector + node_str if depth > 0 else node_str
result.append(line)
else:
result.append(node_str)
if mode == "pre":
if not visual:
result.append(node_str)
result += InternalTraverse(node.left, prefixAcc, True, depth + 1)
result += InternalTraverse(node.right, prefixAcc, False, depth + 1)
elif mode == "in":
result += InternalTraverse(node.left, prefixAcc, True, depth + 1)
if not visual:
result.append(node_str)
result += InternalTraverse(node.right, prefixAcc, False, depth + 1)
elif mode == "post":
result += InternalTraverse(node.left, prefixAcc, True, depth + 1)
result += InternalTraverse(node.right, prefixAcc, False, depth + 1)
if not visual:
result.append(node_str)
return result