Answer Posted / lokesh

"=" is the only operator which can be overloaded but can not
be inherited

What is the point of polymorphism?

1040

---

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

1863

---

What is difference between data abstraction and encapsulation?

1094

---

Get me a number puzzle game-program

2255

---

What is new keyword in oops?

1050

---

Can we define a class within the interface?

1052

---

What is meant by oops concept?

1052

---

What is difference between inheritance and polymorphism?

1036

---

How do you explain polymorphism?

1082

---

What is encapsulation with real life example?

1046

---

What is an advantage of polymorphism?

1098

---

Why is it so that we can have virtual constructors but we cannot have virtual destructors?

4960

---

#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

---

Why is encapsulation used?

1002

---

What is the difference between abstraction and polymorphism?

1108

---