Answer Posted / mayank kumar

in multiple inheritance there is more than one base class
and one derived class.

What are different oops concepts?

1000

---

Write a C++ program without using any loop (if, for, while etc) to print prime numbers from 1 to 100 and 100 to 1 (Do not use 200 print statements!!!)

2042

---

What is multilevel inheritance explain with example?

1089

---

What are the three parts of a simple empty class?

1980

---

Why do we use inheritance?

1061

---

Can enum be null?

963

---

Can a destructor be called directly?

1019

---

Why is oop better than procedural?

1021

---

What is inheritance in oop?

982

---

What exactly is polymorphism?

1073

---

What is difference between multiple inheritance and multilevel inheritance?

1104

---

What is destructor oops?

1035

---

What are the 5 oop principles?

1070

---

What does I oop mean?

1021

---

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

3700

---