Note 1
##### Take Note:

Take a note while surfing.

##### Note With Ink

Give your Note a Colorful Tag.

##### Easy to Access

Stay on same information and in Sync wherever you are.

Note 2
##### Take Note:

Organize your information,It may take Shape.

##### Think With Ink

Differ your Content by Color.

##### Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3
##### Take Note:

Don't Let information to miss,Because it take shape

##### Note With Ink

Simple an Easy Way to take a note.

##### Easy to Access

Get the same in next visit.

Please wait...

Program Discussion :: Trees
Home > Programs > Trees

# ``41. Write a program to traverse the tree in preorder inorder and postorder``

Answer:
``````
#include <stdio.h>#include <stdlib.h>/* A binary tree node has data, pointer to left childand a pointer to right child */struct node{    int data;    struct node* left;    struct node* right;};/* Helper function that allocates a new node with thegiven data and NULL left and right pointers. */struct node* newNode(int data){    struct node* node = (struct node*)    malloc(sizeof(struct node));    node->data = data;    node->left = NULL;    node->right = NULL;    return(node);}/* Given a binary tree, print its nodes according to the"bottom-up" postorder traversal. */void printPostorder(struct node* node){    if (node == NULL)        return;    // first recur on left subtree    printPostorder(node->left);    // then recur on right subtree    printPostorder(node->right);    // now deal with the node    printf("%d ", node->data);}/* Given a binary tree, print its nodes in inorder*/void printInorder(struct node* node){    if (node == NULL)        return;    /* first recur on left child */    printInorder(node->left);    /* then print the data of node */    printf("%d ", node->data);     /* now recur on right child */    printInorder(node->right);}/* Given a binary tree, print its nodes in preorder*/void printPreorder(struct node* node){    if (node == NULL)
``````

#### Asked In ::

Post Your Answer Here:

Name *
Email

Language:

Post Your Reply Here: