Explain about literals?
744
What is Difference between Cost center and Profit center. Can any one explain me?
912
How to migrate paradox, dbase or foxpro database to firebird?
725
What is the syntax of packed number?
841
Why is sql*loader direct path so fast?
801
What is powerpoint aspect ratio?
188
What does the isNaN() function?
706
Write down a program for comparison of strings in any language you know?
884
How TCP/IP Handles Flow Control?
1271
Explain the common uses of tree database.
674
What does entitymanager merge do?
254
#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.
3490
How to find permissible diagonal tensile stress in reinforced brick work
2269
What is entitytype? : Entity framework
711
What evaluation can selenium do?
697
