Implement Inorder, preorder and postorder tree traversal techniques.Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. The following are the generally used methods for traversing trees:INORDER TRAVERSAL:Traverse the left subtree, i.e., call Inorder(left->subtree)Visit the root.Traverse the right subtree, i.e., call Inorder(right->subtree)PREORDER TRAVERSAL:Visit the root.Traverse the left subtree, i.e., call Preorder(left->subtree)Traverse the right subtree, i.e., call Preorder(right->subtree)Postorder Traversal:Traverse the left subtree, i.e., call Postorder(left->subtree)Traverse the right subtree, i.e., call Postorder(right->subtree)Visit the rootInput Format:The input consists of two lines:The first line contains the number of nodes in the binary tree.The second line contains the values of the nodes, separated by spaces, representing the binary tree.Output Format:First Line contains the Inorder TraversalSecod Line contains the Preorder TravesalThird Line contains th Postorder Traversal  Sample input6 5 3 8 1 4 10Sample output1 3 4 5 8 10 5 3 1 4 8 10 1 4 3 10 8 5

Here is a Python implementation of Inorder, Preorder, and Postorder tree traversal techniques:

class Node:
    def __init__(self, key):
        self.left = None
        self.right = None
        self.val = key

def printInorder(root):
    if root:
        printInorder(root.left)
        print(root.val),
        printInorder(root.right)

def printPreorder(root):
    if root:
        print(root.val),
        printPreorder(root.left)
        printPreorder(root.right)

def printPostorder(root):
    if root:
        printPostorder(root.left)
        printPostorder(root.right)
        print(root.val),

# Driver code
root = Node(5)
root.left = Node(3)
root.right = Node(8)
root.left.left = Node(1)
root.left.right = Node(4)
root.right.right = Node(10)

print("Inorder traversal of binary tree is")
printInorder(root)

print("\nPreorder traversal of binary tree is")
printPreorder(root)

print("\nPostorder traversal of binary tree is")
printPostorder(root)

This code first creates a binary tree with the given nodes. Then it prints the Inorder, Preorder, and Postorder traversals of the tree. The printInorder, printPreorder, and printPostorder functions are recursive, and they print the left subtree, the root, and the right subtree in different orders according to the traversal technique.