Answer Posted / devi

The Keyword virtual provides a mechanism for defining the
virtual functions.When declaring the base class member
function,the keyword virtual is used with those
functions,which are to be bound dynamically.

write a program to enter a string like"sunil is a good boy and seeking for a job" not more than 10 characters including space in one line,rest characters should b in other line.if the next line starts from in between the previous word,then print whole word to next line.

2191

---

Please send ford technologies placement paper 2 my mail id

2057

---

What is class in oop with example?

1043

---

What is cohesion in oop?

1010

---

What does no cap mean?

1009

---

What is object and example?

1116

---

What are the 3 pillars of oop?

1101

---

What is overloading in oop?

961

---

What are the 4 main oop principles?

1171

---

Is data hiding and abstraction same?

971

---

What is oops with example?

999

---

What is the renewal class?

2692

---

Why we use classes in oop?

979

---

What is for loop and its syntax?

1039

---

#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

---