-
Notifications
You must be signed in to change notification settings - Fork 40
/
Copy pathfunctions.py
47 lines (35 loc) · 884 Bytes
/
functions.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
from treenode import TreeNode
node: TreeNode = TreeNode('a')
node.insert_left('b')
node.insert_left('c')
node.get_left_child().insert_left('f')
node.insert_right('k')
node.insert_right('j')
print("\nInorder")
node.inorder()
print("\nPreorder")
node.preorder()
print("\nPostorder")
node.postorder()
# functions for tree traversal
def inorder(tree: TreeNode):
if tree is not None:
inorder(tree.left)
print(tree.key, end=", ")
inorder(tree.right)
def preorder(tree: TreeNode):
if tree is not None:
print(tree.key, end=", ")
preorder(tree.left)
preorder(tree.right)
def postorder(tree: TreeNode):
if tree is not None:
postorder(tree.left)
postorder(tree.right)
print(tree.key, end=", ")
print("\nInorder")
inorder(node)
print("\nPreorder")
preorder(node)
print("\nPostorder")
postorder(node)