how a cyclone steam separator works?

1676

How to create shapes with border property.

946

How to loop through array in javascript?

471

if we set slow sync as you suggest in answers on the many online forums you visit, would not we be opening ourselves up to blurred shots when the shutter speed gets significantly below 1/60? : Adobe flash

461

What is the main disadvantage of dom?

474

Which function is used to count the number of intervals between two sas dates?

566

How can you host a silverlight application?

1

How do I find my ip address?

600

Explain the term Moonlight?

5

At present what is the rate of excise duty on sale of Weigh Bridge Machinery to out of state from Karnataka.

1971

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

3246

Is it possible to connect to InterBase from a Delphi app without using the BDE?

1312

How do you troubleshoot server hang?

621

What is the method to save data in stack data structure type?

600

What is mixins in css?

263