What are the different types of model available in coolplex

1463

What is function and its uses?

571

What is pdo classes?

564

What do you know about the historical background of Development Financial Institutions (DFIs)?

1479

Explain bezier curve in adobe photoshop?

53

What is amqp used for?

612

i need the details about bhel exam.how to apply for that.please send to my email-id.thenmozhi2k7@gmail.com

1543

How can one make the most of drupal? What are the main advantages?

89

Why do we use wpf?

112

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

3257

What are the bugs we cannot find in black box?

698

How can we scale apache mahout in cloud?

35

How do I change the project path in visual studio?

412

Difference between sy-tabix and sy-index? Can you check sy-subrc after perform?

645

how meger function

2425