Answer Posted / alaa

20 hr

What is polymorphism and example?

984

---

What does <> mean pseudocode?

1116

---

State what is encapsulation and friend function?

1193

---

How can you overcome the diamond problem in inheritance?

1141

---

What is static in oop?

1028

---

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!!!)

2044

---

What is inheritance and how many types of inheritance?

1043

---

What is purpose of inheritance?

1054

---

What is the purpose of enum?

967

---

What is object and example?

1120

---

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

3704

---

Whats oop mean?

991

---

What is polymorphism explain its types?

1103

---

Why do we use inheritance?

1064

---

What is difference between abstraction and encapsulation?

1023

---