What is test/qa team lead?
681
How to make a picture of a background image of a web page?
546
List out the differences between AngularJS and NodeJS?
284
HOW TO CALCULATE ESI,P.F,VAT,I.TAX,EXCISE,C.S.T.REFUND
CLAIM, E.T.C. IF YOU KNOW ANY OF THIS PLASE REPLY
8859
#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.
3362
What is the main use of preparing a traceability matrix?
782
What is top in css?
353
Do indexes speed up queries?
506
How can we handle web-based pop-up?
638
What is the function used to get a reference to an object inside the silverlight control?
1
Why we used $this->set() in cakephp?
3
What is sap billing system?
5
In a batch if a job fails in between and you want to restart the batch from that particular job and not from the scratch then what will you do?
683
What is the keyboard shortcut for creating a chart from the selected cells?
363
What is a local, member and a class variable?
661
