Answer Posted / ashish sangal[ash don]

We cannot do overloading with C where as C++ supports both
function and operator overloading.

What are the three parts of a simple empty class?

2055

---

How is class defined?

1140

---

What does and I oop mean in text?

1229

---

What is oops and its features?

1082

---

Whats is abstraction in oops?

1073

---

What is inheritance write a program to show use of inheritance?

1147

---

what is the drawback of classical methods in oops?

3381

---

What does I oop mean?

1076

---

What is polymorphism explain?

1256

---

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

3761

---

What is the highest level of cohesion?

1051

---

Why do we use oops?

1018

---

• What are the desirable attributes for memory managment?

2233

---

What is for loop and its syntax?

1086

---

What is the fundamental idea of oop?

1141

---