Answer Posted / sachin

Compiler provide the assignment operator/ copy constructor
by default. The assignment operator and copy constructor do
the bit wise copy of the object. If user want to do the
member wise copy(ex:allocating the memory from the heap)
for the members, one can write his/her own assignment
operator/ copy constructor.

why reinterpret cast is considered dangerous?

2448

---

How can you overcome the diamond problem in inheritance?

1228

---

What is coupling in oops?

1220

---

Is enum a class?

1113

---

Why is encapsulation used?

1054

---

What is object and class in oops?

1115

---

What is polymorphism in oop example?

1069

---

which feature are not hold visual basic of oop?

2233

---

Can we override main method?

1280

---

Can we create object of abstract class?

1147

---

Whats is abstraction in oops?

1136

---

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

3826

---

What do you mean by abstraction?

1121

---

What are different oops concepts?

1113

---

what type of question are asked in thoughtworks pair programming round ?

2267

---