What is the list view and summary view?
255
what are the main issues you faced in the implementation
project?
1650
Can you define feature vector?
111
What is an execution plan? How would you view the execution plan?
656
How do you insert equation tools in word?
389
What is the main source of power in aircraft?
774
#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.
3375
What happens when arraylist is full?
594
What do you mean by DBMS?
647
What is difference between supply chain collaboration and supply chain coordination?
222
What is compression - row-level and page-level compression?
616
What is a descendant selector?
382
What are the life cycle methods of interceptor?
613
Describe your approach to managing difficult airways and the steps you take to secure a patient's airway.
181
Is f5 a firewall?
151