-
Notifications
You must be signed in to change notification settings - Fork 0
/
TraversalTechniques_Q2.py
49 lines (43 loc) · 1.43 KB
/
TraversalTechniques_Q2.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
48
49
# ucse20057 | Gayatri Rout | DSA assignment
# Implementing 3 traversal techniques on Binary Tree: In/Pre/Post order
class Node:
def __init__(node, data):
node.left = None
node.right = None
node.data = data
# function to display Inorder tree traversal
def displayInorder(node):
if node.left:
node.left.displayInorder()
print(node.data, end = " ")
if node.right:
node.right.displayInorder()
# function to display Preorder tree traversal
def displayPreorder(node):
print(node.data, end = " ")
if node.left:
node.left.displayPreorder()
if node.right:
node.right.displayPreorder()
# function to display Postorder tree traversal
def displayPostorder(node):
if node.left:
node.left.displayPostorder()
if node.right:
node.right.displayPostorder()
print(node.data, end = " ")
# create binary tree
root = Node(13)
root.left = Node(56)
root.right = Node(39)
root.left.left = Node(23)
root.left.left.left = Node(76)
root.left.left.right = Node(21)
root.left.right = Node(34)
# Printing Binary Tree
print("\nIn-order (Left -> Root -> Right): ")
root.displayInorder()
print("\nPre-order (Root -> Left -> Right): ")
root.displayPreorder()
print("\nPost-order (Left -> Right -> Root): ")
root.displayPostorder()