Answer Posted /

Is This Answer Correct ?    Yes No

Post New Answer View All Answers









Please Help Members By Posting Answers For Below Questions

i want to learn mainframe..any websites and material to learn from basic..? my mail id : rajeswaribe2010@gmail.com

667


How will you enable SMTP on Application Server?

110


what is mean by ideal infinite bus? why it is required to consider in fault short circuit calculations?

942


HOW I CAN PREPARE A BALANCE SHEET OF A COMPANY ?

311


Recent banking question for 2015 interview for scale2 exam of sbm

340


How to calibrate DP tramitter in flow measurement application? consider my range of flow is 0 to 2000 kg/hr ? please give calculation of , How much pressure applied on low pressure side and high pressure side please give detail of calculation .... It so important for me please reply as soon as possible

571


whether fibre optic cable in high voltage earth conductor is used for protection circuits

87


How the positive and negative DNA markers are used in genetic engineering?

950


what are the Differences between ActiveX Control and Standard Control?

1930


in dc machine airgap is there b\w stator and armature but by conduction emf is generated how & what is conduction

620


Can any tell me how a clinical data management system is tested? what are the test scenarios? what are the test cases? work flow.

320


i want to ecil (Electronics Corporation of India Limited Hyderabad) previous civil engineering question papers immediately please.............

1314


How can I use bugzilla in my company to track a bug and to allow the client to see the bug report online throughbugzilla. Please explain in detail. I am really need this.

1508


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

660


i need to give section engineer (electrical engineer) for RRB. Please suggest some book

293