Explain the new events in textbox that has been included in vb?

937

What are the different parts of a deployment diagram?

873

Explain Secret splitting protocol?

1378

What are the advantages of a presentation?

322

List r/3 user types?

554

Define concatenating?

1070

What is the mean of whitening in toothpaste?

774

what is the process where wml cards request the device to access wap?

736

Hi Friends, I am preparing for Airport authority of India ,so please forward me question papers and questions that are generally asked in test. my email ID is :jitinkumar_micro@rediffmail.com

1845

What is angular 6 and why it is used?

753

What do you think about the latest algorithm update from google?

809

i got a backdoor offer in process global,Bangalore..Can i work with it?

2817

What is portal (structure and content)?

933

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

3725

how do I pass a variable by reference?

806