Answer Posted / praveen kumar

No no no..

What is super in oop?

1260

---

Can destructor be overloaded?

1097

---

Give two or more real cenario of virtual function and vertual object

2366

---

How long to learn object oriented programming?

1145

---

How do you answer polymorphism?

1110

---

What is basic concept of oop?

1222

---

What is overloading in oops?

1213

---

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

3830

---

What is protected in oop?

1118

---

Can we create object of abstract class?

1149

---

Please send ford technologies placement paper 2 my mail id

2148

---

What is polymorphism what is it for and how is it used?

1058

---

What is the oops and benefits of oops programming?

1030

---

just right the logic of it 1--> If few people are electing then every time ur candidate should win 2--> arrange books in box, if box carry weight == books weight then take another box..... find the no of box required.

6994

---

What is encapsulation example?

1124

---