What does sqldatareader return?

969

---

Can any one give information on "Content Disposition" in TEST COMPLETE automation tool? mail me to pdamarakonda@smart-bridge.co.in call me to 09849423932

2061

---

Explain HBase Architecture in brief?

206

---

explain databases and sql server databases architecture? : Sql server database administration

969

---

Can you explain one critical mapping?

1006

---

How to schedule export or take the backup of salesforce?

456

---

What are controlled and uncontrolled components in React?

371

---

In businessobjects 4.2, what are the different ways to connect webi to hana views? : hana bi development

90

---

What do you understand by openui5?

508

---

What can I do with joomla?

83

---

What is blue prism work queue?

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.

3773

---

What is the advantage of .net?

991

---

If you are truncated using JDBC, how can you that how much data is truncated?

1059

---

How to check coding errors in css?

764

---