Answer Posted / darshan

Rahul

Write a program to implement OOPS concepts such as inheritance, polymorphism, friend function, operator overloading?

4705

---

What language is oop?

990

---

What are oops methods?

961

---

What is the real time example of encapsulation?

1022

---

Can private class be inherited?

1135

---

What is the purpose of enum?

978

---

What is oops and why we use oops?

1010

---

Can we create object of interface?

1092

---

What is the point of oop?

1131

---

What is oops in simple words?

1052

---

What is protected in oop?

1033

---

How Do you Code Composition and Aggregation in C++ ?

25334

---

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

3721

---

Write a c++ program to display pass and fail for three student using static member function

3353

---

What is coupling in oop?

996

---