From b12e39952d7338dc792ab3b7a6e933a3ea194f7c Mon Sep 17 00:00:00 2001 From: schoeffelbe82781 Date: Wed, 23 Apr 2025 10:45:53 +0200 Subject: [PATCH] Removed no longer needed function, cleaned up structure --- schoeffelbe/pr04.py | 23 ++--------------------- 1 file changed, 2 insertions(+), 21 deletions(-) diff --git a/schoeffelbe/pr04.py b/schoeffelbe/pr04.py index 25d3f2c..5e1dca5 100644 --- a/schoeffelbe/pr04.py +++ b/schoeffelbe/pr04.py @@ -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