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
- 37244 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
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);
}
| Is This Answer Correct ? | 1 Yes | 2 No |
List the types of rotations available in splay tree?
What is binary tree used for?
What do you mean by free pool?
Which interfaces are implemented by linkedhashset?
What is bubble sort algorithm?
Can treeset have duplicates?
Can a stack be described as a pointer? Explain.
What are the differences between b tree and b+ tree?
What is frozenset?
What is the time complexity of selection sort?
Is array a collection?
What is sorting explain?
Windows 
