Answer Posted / prathyusha

c++ supports the over loadind function which is not
supported in c programming

What is abstraction encapsulation?

1199

---

Why is it so that we can have virtual constructors but we cannot have virtual destructors?

5048

---

What are the 3 pillars of oop?

1245

---

What is encapsulation in ict?

1118

---

What is advantage of inheritance?

1225

---

What is meant by multiple inheritance?

1334

---

Can we create object of abstract class?

1148

---

What are properties in oop?

1142

---

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

3829

---

what are the different types of qualifier in java?

2318

---

Why is there no multiple inheritance?

1063

---

Write a program to reverse a string using recursive function?

2409

---

Can a destructor be called directly?

1135

---

What is a superclass in oop?

1220

---

What are the benefits of oop?

1347

---