Question

PYTHON 3 CODING

Review the following tree and then implement Depth First Traversals. Your program should display the output from Inorder to Preorder and Postorder.

V. 0111

Include the following items in your answer:

• Write the implementation for Inorder, Preorder, and Postorder
• Print the output for each of the Inorder, Preorder, and Postorder

Use the following steps to help with your solution:

• Create the node structure. Each node structure should contain the data, left node and right node.
• Create a function to add a node.
• Write the implementation for PrintInOrder.
• Write the implementation for PrintPreOrder.
• Write the implementation for PrintPostOrder.

Answer 1

# class for Node
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None

# adding Node to tree

def addNode(root, node):
if root is None:
root = node
else:
if root.data < node.data:
if root.right is None:
root.right = node
else:
addNode(root.right, node)
else:
if root.left is None:
root.left = node
else:
addNode(root.left, node)

# inOrder tree traversal
def printInOrder(root):

if root:

# First recur on left child
printInOrder(root.left)

# then print the data of node
print(root.data, end=" ")

# now recur on right child
printInOrder(root.right)

# postOrder tree traversal
def printPostOrder(root):

if root:

# First recur on left child
printPostOrder(root.left)

# the recur on right child
printPostOrder(root.right)

# now print the data of node
print(root.data, end=" ")

# preOrder tree traversal
def printPreOrder(root):

if root:

# First print the data of node
print(root.data, end=" ")

# Then recur on left child
printPreOrder(root.left)

# Finally recur on right child
printPreOrder(root.right)

if __name__ == "__main__":
n = int(input("Enter the number of nodes you want to Enter : "))

data = input("Enter the data for Node 1 : ")

root = Node(data)

for i in range(2, n+1):
data = input("Enter the data for Node {} : ".format(i))
node = Node(data)
addNode(root, node)

print("\nPreOrder traversal of binary tree is")
printPreOrder(root)

print("\n\nInOrder traversal of binary tree is")
printInOrder(root)

print("\n\nPostOrder traversal of binary tree is")
printPostOrder(root)


# class for Node class Node: def init_(self, data): self.data = data self.left = None self.right = None # adding Node to tree 10 def addNode (root, node): if root is None: 12 root = node 13 else: 14 if root.data < node.data: 15 if root.right is None: root.right = node 16 17 else: 18 addNode (root.right, node) 19 else: 20 if root.left is None: 21 root.left = node 22 else: 23 addNode(root. left, node) 25 26 # in0rder tree traversal 27 def printInorder( root ): 28 29 if root: 30 31 # First recur on left chi ld 32 printInorder( root . left) 33 34 # then print the data of node 35 print (root.data, end=" ") 36 37 # now recur on right child 38 printInorder( root.right) 39 40 41 # postorder tree travers al def printPost0 rder ( root): 42 43 44 if root: 45 46 # First recur on left chi ld 47 printPostorder ( root. left ) 48 49 # the recur on right child printPost0rder(root.right) 50 51 52 # now print the data of node print (root.data, end=" ") 53 54 55 56

56 # pre0rder tree traversal def printPre0 rder ( root ) : 57 58 59 if root: 60 61 # First print the data of node print(root.data, end=" ") 62 63 64 # Then recur on left child 65 printPreOrder( root. left) 66 67 # Finally recur on right child printPre0rder( root .right) 68 69 70 71 if "main_": 72 name n = int (input ( "Enter the number of nodes you want to Enter 73 74 input ("Enter the data for Node 1 : ") data 75 76 root = Node (data) 77 78 for i in range (2, n+1): 79 input ("Enter the data for Node {} : ".format (i data 80 node Node (data) 81 addNode (root, node) 82 83 print("\nPreOrder traversal of binary tree is") 84 printPreOrder ( root) 85 86 print ("\n\nIn0 rder traversal of binary tree is") printInorder( root) 87 88 89 print ("\n\nPostO rder traversal of binary tree is") printPostOrder( root) 90 91 92

#please upvote if you like the answer :)