How to fix back the valve actuator stem

927

what is ACID test for fresh engineers??what is the pattern??

1808

where can the transformer having vector group Yny0 be used??

2415

suppose we have 400 users in that 300 can able to connect to the Database and 100 cannot

392

What is true sine wave or pure sine wave inverter?? Is it sine wave or step wave?? If it is step wave, waves with how much step is considered as pure sine wave? Is it possible to produce pure sinewave using power electronics?

715

Can any one tell how to install the TD in our system?

1056

can any one suggest me the tilt angle of my solar pannel ?? or tell me how can i know the fix tilt angle of my solar pannel?? my cordinates are 31.503629,72.993164.

709

What are core components of Flume?

5

A individual advocate recievs legal fees. is he liable to pay service tax @ 12.36% on it?

775

What is the difference between a Listener process and a Handler process?

355

What is differential cryptanalysis?

983

I am doing a engineering contract with GOI. I have purchased certain material from outside Maharashtra and paid CST on that material @ 5.25%. Please intimate whether I will be liable for VAT or VAT on works contract or not.

827

Describe the various server agents that support the process scheduler server?

406

What is MapFile?

175

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

1431