What are the changes presented by actionscript?
864
Define each() function in jquery?
801
What is the value of a[3] if integer a[] = {5,4,3,2,1}?
1090
What are the most important attacks on symmetric block ciphers?
3077
What do you understand by hybris promotion management?
5
What is the use of ienumerable?
865
What is powerpoint and its features?
355
Explain calculate distance methods briefly?
319
What are the weight of 800KV DA,DB and DC type tower ?
3146
How do you make a div 0 0?
615
How to see the event list of an existing trigger using sys.trigger_events?
1073
#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.
3762
Does windows server 2019 have a gui?
320
How would you make payroll corrections?
956
which are the key concepts of entity data model?
1094
