Created
February 11, 2019 00:09
-
-
Save kafagy/8a382c6d9d611115d46c587626bcce81 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Node(object): | |
def __init__(self, value): | |
self.value = value | |
self.left = None | |
self.right = None | |
class BinaryTree(object): | |
def __init__(self, root): | |
self.root = Node(root) | |
def print_tree(self, traversal_type): | |
if traversal_type == "preorder": | |
return self.preorder_print(tree.root, "") | |
elif traversal_type == "inorder": | |
return self.inorder_print(tree.root, "") | |
elif traversal_type == "postorder": | |
return self.postorder_print(tree.root, "") | |
else: | |
print("Traversal type " + str(traversal_type) + " is not supported.") | |
return False | |
def preorder_print(self, start, traversal): | |
"""Root->Left->Right""" | |
if start: | |
traversal += (str(start.value) + "-") | |
traversal = self.preorder_print(start.left, traversal) | |
traversal = self.preorder_print(start.right, traversal) | |
return traversal | |
def inorder_print(self, start, traversal): | |
"""Left->Root->Right""" | |
if start: | |
traversal = self.inorder_print(start.left, traversal) | |
traversal += (str(start.value) + "-") | |
traversal = self.inorder_print(start.right, traversal) | |
return traversal | |
def postorder_print(self, start, traversal): | |
"""Left->Right->Root""" | |
if start: | |
traversal = self.postorder_print(start.left, traversal) | |
traversal = self.postorder_print(start.right, traversal) | |
traversal += (str(start.value) + "-") | |
return traversal | |
# 1 | |
# / \ | |
# 2 3 | |
# / \ / \ | |
# 4 5 6 7 | |
tree = BinaryTree(1) | |
tree.root.left = Node(2) | |
tree.root.right = Node(3) | |
tree.root.left.left = Node(4) | |
tree.root.left.right = Node(5) | |
tree.root.right.left = Node(6) | |
tree.root.right.right = Node(7) | |
print(tree.print_tree("preorder")) # 1-2-4-5-3-6-7 | |
print(tree.print_tree("inorder")) # 4-2-5-1-6-3-7 | |
print(tree.print_tree("postorder")) # 4-2-5-6-3-7-1 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment