DS || Section B || pgm 9 || Program to display in-order traversal of a binary tree.

 #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;

inorderTraversal(root->left);

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

inorderTraversal(root->right);

}

void display(struct node* root)

{

if (root == NULL) return;

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

display(root->left);

display(root->right);

}

// Create a new Node

struct node* createNode(int 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;

}

void main()

{

struct node* root = createNode(1);

insertLeft(root, 12);

insertRight(root, 9);

insertLeft(root->left, 5);

insertRight(root->left, 6);

printf("tree \n");

display(root);

printf("\nInorder traversal \n");

inorderTraversal(root);

}