Answer Posted / sudeep dutta

Rahul loses his name and becomes ahul.

Why is static class not inherited?

1108

---

What is a class and object?

1055

---

Get me a number puzzle game-program

2251

---

What is the highest level of cohesion?

1052

---

When not to use object oriented programming?

1110

---

What is the main purpose of inheritance law?

1199

---

What is pure oop?

1105

---

What is coupling in oops?

1156

---

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

3763

---

What is debug class?what is trace class? What differences are between them? With examples.

2198

---

Where You Can Use Interface in your Project

1893

---

what type of questions

2129

---

Get me an image implementation program.

1987

---

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

1861

---

Why polymorphism is used in oops?

1053

---