Is dev c++ a good compiler?

520

Can you explain repository tables in datastage?

894

what are your suggestions for making workers participation more affective in an it industry

3379

What are RC and L/R time constants? What is their significance?

1364

How do I start iis from command prompt?

458

Where does the gac exist ?

577

Explain canyon?

445

STATE & EXPLAIN THE IMPACT OF GLOBAL FINANCIAL CRIS ON CEMENT SECTOR IN INDIA:

1832

What is page scope?

485

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

3240

Is wordpress hosting free?

93

Differentiate between the user mode and monitor mode.

612

How do you start and stop services in unix without using admin console?

579

I would like to know the age limit for appearing interview in Sutherland.

1724

How to calculate approximate load loss of a distribution transformer by knowing %ge imp of transformer?

1740