Answer Posted / ashutosh bhawasinka

Refer to this.

http://www.parashift.com/c++-faq-lite/virtual-functions.html#faq-20.4

Why do we use inheritance?

628

---

What causes polymorphism?

569

---

What is object and class in oops?

586

---

What is encapsulation example?

545

---

Can private class be inherited?

615

---

---

write a program to find 2^n+1 ?

1546

---

What is abstraction and encapsulation?

569

---

What is destructor in oop?

621

---

What is destructor give example?

601

---

What is pure oop?

597

---

What is object and example?

602

---

Why oops is important?

605

---

INSTANCE FIELDS DECLARED private ARE ACCESSIBLE BY THE METHODS ONLY.CAN WE CHANGE THE private FIELD OF AN OBJECT IN A METHOD OF SOME OTHER OBJECT OF THE SAME CLASS?

1632

---

How long to learn object oriented programming?

561

---

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

3246

---