Answer Posted / rajveer

c++ provide 2types of overloading.
1. Function overloading:- When we create more then 1
function as same name(like Sum)then it's overloading.
this types overloading in perameters are deffrent becouse
compiler is not know which function called. so sum(),sum
(int,int),sum(int float)etc.
2. operatore overloading:- in c++ operatore(+,-,/ etc.)
worked only builtin datatype. but we can use operatore in
user defined data type by operatore overloading.

What are two types of polymorphism?

1120

---

What is overloading and its types?

1244

---

What is polymorphism give a real life example?

1077

---

Is oop better than procedural?

1086

---

i=20;k=0; for(j=1;k-i;k+=j<10?4:3) { cout<

1916

---

What is abstract class in oops?

1071

---

Get me a number puzzle game-program

2307

---

What is abstraction encapsulation?

1193

---

What is destructor oops?

1151

---

What are the benefits of polymorphism?

1359

---

What is oops with example?

1099

---

Explain the concepts involved in Object Oriented programming.

1309

---

What is encapsulation process?

1100

---

What is polymorphism and example?

1093

---

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

3821

---