#include <stdio.h>

#include <stdlib.h>

struct node {

int item;

struct node* left;

struct node* right;

};

// Inorder traversal

void inorderTraversal(struct node* root) {

if (root == NULL) return;

// Visit Left subtree

inorderTraversal(root->left);

// Print the data

printf("%d ->", root->item);

// Visit right subtree

inorderTraversal(root->right);

}

// preorderTraversal traversal

void preorderTraversal(struct node* root) {

if (root == NULL) return;

// Print the data

printf("%d ->", root->item);

// Visit Left subtree

preorderTraversal(root->left);

// Visit right subtree

preorderTraversal(root->right);

}

// postorderTraversal traversal

void postorderTraversal(struct node* root) {

if (root == NULL) return;

// Visit Left subtree

postorderTraversal(root->left);

// Visit right subtree

postorderTraversal(root->right);

// Print the data

printf("%d ->", root->item);

}

// Create a new Node

struct node* createNode(value) {

struct node* newNode = malloc(sizeof(struct node));

newNode->item = value;

newNode->left = NULL;

newNode->right = NULL;

return newNode;

}

// Insert on the left of the node

struct node* insertLeft(struct node* root, int value) {

root->left = createNode(value);

return root->left;

}

// Insert on the right of the node

struct node* insertRight(struct node* root, int value) {

root->right = createNode(value);

return root->right;

}

int main() {

struct node* root = createNode(1);

insertLeft(root, 12);

insertRight(root, 9);

insertLeft(root->left, 5);

insertRight(root->left, 6);

printf("Inorder traversal \n");

inorderTraversal(root);

printf("\n\nPreorder traversal \n");

preorderTraversal(root);

printf("\n\nPostorder traversal \n");

postorderTraversal(root);

}