What is the difference between the knockout and jquery?
615
Describe the modifier in c?
845
What information needs to be provided in order to set up my appliance to do cookie load balancing?
746
What is mining?
1
What is css after and before?
398
How to retrieve data from database in wpf?
141
How does partition assignment relate to transactions in sybase?
610
What is redim keyword and its use?
760
What are the main uses of the transaction in the cics?
771
What is selection in ms word?
404
How do I make an average formula in excel?
391
How to reduce function call overhead in arm based systems
581
#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.
3492
Why main method is called first in java?
726
Wt is the diff between fix value and value mapping?
16157
