what is means of sap

1029

How do I get started with search engine marketing activities?

82

What are the fundamental principles of oo programming?

76

Enlist the disadvantages of query.

103

Bootstrap multiple form types i.e. Horizontal, inline and basic have similar views when they are viewed under 768px devices? Yes or no explain?

1

What are the important differences between apache and hadoop?

65

Why do we use namespace feature?

91

Explain heat treatment of brass?

97

How is a goods receipt performed?

342

what is bailout fund and what are the main drawbacks of bailout funds? what is the role of bailout fund in an economy and what are the impact of bailout fund on market , economy , the bailout provider and the bailout reciever?

1245

how to implement one-to-one, one-to-many and many-to-many relationships while designing tables? : Sql dba

95

#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.

2083

What is int32 maxvalue?

57

Is bsd faster than linux?

63

what is colour port? what is the use with it?

1091