Answer Posted / manish

c by baloo, naresh it is best.

What is difference between polymorphism and inheritance?

1026

---

What are functions in oop?

999

---

What is use of overloading?

1083

---

Why oops is important?

1032

---

Write a program to reverse a string using recursive function?

2278

---

What is the main feature of oop?

1101

---

What is pure oop?

1050

---

What are classes oop?

978

---

What is polymorphism programming?

1075

---

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

3702

---

Why we use classes in oop?

979

---

Why do we use encapsulation in oops?

973

---

What is polymorphism in oop example?

962

---

Write A Program to find the ambiguities in Multiple Inheritance? How are they resolved.(Virtual Functions)

4084

---

What does and I oop and sksksk mean?

1110

---