Answer Posted / vinoth

one of the easiest way to implementing the project.how means team members to do all works,related to that project.

What is a class oop?

964

---

class type to basic type conversion

2351

---

How to call a non virtual function in the derived class by using base class pointer

6450

---

Where You Can Use Interface in your Project

1852

---

What do you mean by variable?

988

---

to find out the minimum of two integer number of two different classes using friend function

2091

---

Why do we use oops?

976

---

String = "C++ is an object oriented programming language.An imp feature of oops is classes and objects".Write a pgm to count the repeated words from this scenario?

2352

---

What is the importance of oop?

1049

---

What is oops with example?

1013

---

What are the features of oop?

1114

---

Why it is called runtime polymorphism?

1073

---

Explain the concepts involved in Object Oriented programming.

1171

---

What is polymorphism used for?

1032

---

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

3719

---