Answer Posted / fgf

i also want answer for this question

Whats is abstraction in oops?

1036

---

What is the significance of classes in oop?

1097

---

How do you achieve polymorphism?

1056

---

• What are the desirable attributes for memory managment?

2191

---

What are the benefits of interface?

1012

---

What is destructor oops?

1050

---

What is the benefit of oop?

1018

---

Give two or more real cenario of virtual function and vertual object

2303

---

What is the difference between inheritance and polymorphism?

1073

---

#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

---

When not to use object oriented programming?

1049

---

What is overloading and its types?

1117

---

What is a null tree?

1103

---

What is polymorphism explain?

1215

---

Can abstract class have normal methods?

1017

---