Is it necessary to write a mapreduce job in java?
391
What are the different resource types in sap supply chain?
177
Is spark difficult to learn?
192
What are the types of the transaction management that is supported by spring?
133
What is loadmodule in apache?
476
Do string constants represent numerical values?
892
In sickle cell anemia, a hereditary disease, there is substitution of one amino acid by other in one of the four-polypeptide chains of hemoglobin. In this case, are all of the structural levels of the protein modified?
700
Define an algorithm to discover when a person is starting to search for new job.
135
#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.
3217
What is unique index?
25
What are Random Forests?
113
women in politics
1974
How do you convert basic cube to transaction cube and
transaction cube to basic cube?
1746
What are three common types of traversals?
433
Explain what is the JSF architecture?
72