Answer Posted / gp

Class which cannot be initiated is an abstract class.
You can make a class abstract by declaring a pure virtual method inside the class. For example:

class base
{
void func()=0;
};

void main()
{
base b;
}

Now you cannot instantiate base class.
The class which inherits this base class will also become abstract unless you define a body of the func() method in inherited class.

Why is polymorphism needed?

1076

---

What is advantage of inheritance?

1175

---

What is encapsulation oop?

1044

---

What are the 4 pillars of oop?

1151

---

can inline function declare in private part of class?

4417

---

What exactly is polymorphism?

1133

---

if i have same function with same number of argument but defined in different files. Now i am adding these two files in a third file and calling this function . which will get called and wht decide the precedence?

3533

---

How is class defined?

1144

---

What are the 3 principles of oop?

1124

---

Explain virtual inheritance?

1209

---

What is inheritance and how many types of inheritance?

1105

---

which feature are not hold visual basic of oop?

2195

---

What makes a language oop?

1068

---

Why is oop better than procedural?

1084

---

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

3767

---