How will inorder, preorder and postorder traversals print the elements of a tre

How will inorder, preorder and postorder traversals print
the elements of a tree?

Question Posted / guest

11 Answers
33819 Views
I also Faced
E-Mail Answers

Answers were Sorted based on User's Feedback

How will inorder, preorder and postorder traversals print the elements of a tree?..

Answer / narendra sharma

struct tree
{
int data;
struct NODE, *left, *right;
}
typedef struct node;

void inorder(node * tree)
{
if(root!=null)
inorder(tree->leftchild);
printf("%d",tree->data);
inorder(tree->rightchild);
}

void preorder(node * tree)
{
if(root!=null)
printf("%d",tree->data);
preorder(((tree->leftchild);
preorder(((tree->rightchild);
}

void postorder(node * tree)
{
if(root!=null)
postorder(tree->leftchild);
postorder(tree->rightchild);
printf("%d",tree->data);
}