Is cloud cheaper than dedicated server?
537
How to start kafka server?
298
if have created a replicate process in ogg 12c and forgot to specify discardfile parameter. What will happen?
5
What are the advantages of using jsx?
139
Whether our own specific characters are used in place of $ in jQuery?
399
How do you change data in access?
392
What are the ways to create input forms for workflow?
351
What are the steps to migrate changes from a development to a test an environment (compare, check Audit flags, migration, validate)?
857
What is a block in HDFS? what is the default size in Hadoop 1 and Hadoop 2? Can we change the block size?
30
Is spring boot a mvc? : Spring Boot
126
#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.
3138
What is ZooKeeper quorum?
5
What are the three main types of models?
423
What are your KPI’S / KRA's ?
1415
How to work E.L.C.B and how to connect in circuit.
1430