What are the ITU-T (CCITT) Standards ?
1528
What is the use of illustrate in pig?
290
What is informix sql?
535
What is name of first file the loaded when yii framework starts?
3
what horticultural practices are required to advance the
maturity of fruit?
1468
Which rpa provides an open platform for automation?
1
#include
#include
#include
#include
void insert(struct btreenode **, int);
void inorder(struct btreenode *);
struct btreenode
{
struct btreenode *leftchild;
struct btreenode *rightchild;
int data;
};
main()
{
struct btreenode *bt;
bt=(struct btreenode *)NULL;
int req,i=1,num;
clrscr();
printf("Enter number of nodes");
scanf("%d",&req);
while(i<=req)
{
printf("Enter element");
scanf("%d",&num);
insert(&bt,num);
i++;
}
inorder(bt);
}
void insert(struct btreenode **sr, int num)
{
if(*sr==NULL)
{
*sr=(struct btreenode *)malloc (sizeof(struct btreenode));
(*sr)->leftchild=(struct btreenode *)NULL;
(*sr)->rightchild=(struct btreenode *)NULL;
(*sr)->data=num;
return;
}
else
{
if(num < (*sr)->data)
insert(&(*sr)->leftchild,num);
else
insert(&(*sr)->rightchild,num);
}
return;
}
void inorder(struct btreenode *sr)
{
if(sr!=(struct btreenode *)NULL)
{
inorder(sr->leftchild);
printf("\n %d",sr->data);
inorder(sr->rightchild);
}
else
return;
}
please Modify the given program and add two methods for post
order and pre order traversals.
3246
In a numeric pyramid, is it possible the base to be smaller than the other levels?
134
How do I run a php file?
512
What is object repository in qtp?
559
How do I run managed code in a process?
505
What is the purpose of xmlaccess configuration file export.xml?
422
Why is c++ so fast?
529
What is query in ms access?
425
Is clustered index a primary key?
528
