What is modulation? And where it is utilized?

1189

---

Explain how can create a backup and copy files in Jenkins?

5

---

Why is jdbc needed?

921

---

Which of the end-user items leverage olap services?

896

---

What differences exist between hashmap and hashtable?

998

---

What is the use of fillable in laravel?

802

---

What is the concept of postback in asp.net?

1047

---

What is the formula for the Capital Asset Pricing Model?

1107

---

How is ‘build’ different from ‘release’?

1174

---

List the devices compatible with ios 11? : IOS Architect

740

---

What are the advantages of swing over awt?

909

---

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

3773

---

What is the use of counting rules?

988

---

What are s0c1, s0c4, s0c5, s0c7 and socb?

1183

---

Can you crop a shape in powerpoint?

328

---