Interested to Buy Any Domain ? << Click Here >> for more details...
How will inorder, preorder and postorder traversals print
the elements of a tree?
- 11 Answers
- 36506 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / meganathan
void inorder(node * tree)
{
if(tree != NULL)
{
inorder(tree->leftchild);
printf("%d ",tree->data);
inorder(tree->rightchild);
}
else
return;
}
void postorder(node * tree)
{
if(tree != NULL)
{
postorder(tree->leftchild);
postorder(tree->rightchild);
printf("%d ",tree->data);
}
else
return;
}
void preorder(node * tree)
{
if(tree != NULL)
{
printf("%d ",tree->data);
preorder(tree->leftchild);
preorder(tree->rightchild);
}
else
return;
}
| Is This Answer Correct ? | 54 Yes | 10 No |
Answer / kayalvizhi jayavel
Inorder: Left, Node, Right
Preorder: Node, Left, Right
Postorder: Left, Right, Node
| Is This Answer Correct ? | 30 Yes | 7 No |
Answer / srinivas.bolusupati
in order:LOR
pre order:OLR
post order:LRO
| Is This Answer Correct ? | 18 Yes | 3 No |
Answer / sankar
in order:LOR
pre order:OLR
post order:LRO
L=LEFT CHILD
R=RIGHT CHILD
O=ROOT NODE
| Is This Answer Correct ? | 15 Yes | 6 No |
Answer / shital
typedef struct NODE
{
int data;
struct NODE *left,*right;
}node;
void inorder(node * tree)
{
if(tree != NULL)
{
inorder(tree->leftchild);
printf("%d ",tree->data);
inorder(tree->rightchild);
}
}
void postorder(node * tree)
{
if(tree != NULL)
{
postorder(tree->leftchild);
postorder(tree->rightchild);
printf("%d ",tree->data);
}
}
void preorder(node * tree)
{
if(tree != NULL)
{
printf("%d ",tree->data);
preorder(tree->leftchild);
preorder(tree->rightchild);
}
}
| Is This Answer Correct ? | 11 Yes | 4 No |
Answer / soma gidugu
void inorder(node * root)
{
if(root!= NULL)
{
inorder(root->leftchild);
printf("%d ",root->data);
inorder(root->rightchild);
}
else
return;
}
void postorder(node * root)
{
if(root!= NULL)
{
postorder(root->leftchild);
postorder(root->rightchild);
printf("%d ",root->data);
}
else
return;
}
void preorder(node * root)
{
if(root!= NULL)
{
printf("%d ",root->data);
preorder(root->leftchild);
preorder(root->rightchild);
}
else
return;
}
| Is This Answer Correct ? | 13 Yes | 7 No |
Answer / sanjeevi
in order:lRr
preorder:Rlr
postorder:lrR
l:left
r:right
R:root
| Is This Answer Correct ? | 10 Yes | 6 No |
Answer / meenakshi
INORDER:: LNR
PREORDER:: NLR
POSTORDER::LRN
here L stands for the leftnode of the tree R stands for the
right node of the tree and N stands for the root node of
that tree.
| Is This Answer Correct ? | 10 Yes | 6 No |
Is bubble sort faster than selection sort?
Why do we use arrays?
Have you ever used HashTable and Directory?
Which is faster hashset or treeset?
Is treemap sorted?
Is hashmap fail safe?
Whether Linked List is linear or Non-linear data structure?
Define outdegree of a graph?
Differentiate between iterator and enumeration.
Which is faster hashmap or concurrenthashmap?
What are three common types of traversals?
Which file contains the definition of member functions?
Windows 
