Answer Posted /

How do we separate one dimensional, two dimensional and three-dimensional data?

111

---

Is boolean a datatype in c?

1074

---

In which medium the velocity of sound is large?

937

---

How to open microsoft word document, power point etc. On linux suse version and vise versa?

973

---

Gamma hydroxybutyrate no of tables we are able to take part tableau?

412

---

I'm having some trouble with cas. How can I troubleshoot the problem?

1016

---

working function importance of mdc meter

2169

---

Why does a pressure gauge installed on reactor, doesn't have any vent line below to release the pressure? Is it any kind of designing mistake or it actually does not require any vent line? And if it does not require any vent line below it then how we are gonna release the pressure built inside the pressure gauge?

2172

---

How do I automatically restart iis?

954

---

How can values be passed from the job stream to an executable program?

1446

---

You are the project manager for the Late Night Smooth Jazz Club chain, with stores in 12 states. Smooth Jazz is considering opening a new club in Kansas City or Spokane. You have derived the following information: Project Kansas City: The payback period is 27 months, and the IRR is 35 percent. Project Spokane: The payback period is 25 months, and the IRR is 32 percent. Which project should you recommend to the selection committee? A. Project Spokane because the payback period is shortest B. Project Kansas City because the IRR is highest C. Project Spokane because the IRR is lowest D. Project Kansas City because the payback period is longest ?

1059

---

What is difference between type4 and type2?

939

---

Hi,I have recieved an i-20 from 2 years college for my bachelors degree,how can i convince the consular about this course i.e.computer and information science.plz help me as soon as possible.

1938

---

How to modify the text checkpoint?

1118

---

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

3770

---