Answer Posted / vaibhav

In simple way,
The complex programming organizing in to simple structure by
using the concepts methodologies of,
Encapsulation
Abstraction
Polymorphism
Inheritance.

Why do we need polymorphism in c#?

902

---

What are oops methods?

777

---

Why multiple inheritance is not allowed?

838

---

Can you inherit a private class?

859

---

What are the advantages of polymorphism?

783

---

Templates mean

1854

---

How is class defined?

852

---

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

3525

---

What is the importance of oop?

857

---

Can we have inheritance without polymorphism?

815

---

What is for loop and its syntax?

820

---

What is cohesion in oop?

857

---

What are the 3 pillars of oop?

884

---

Why is polymorphism needed?

808

---

What are the components of marker interface?

813

---