Answer Posted / prabu

This mainthing is oops concept.

polymorphism,
inheritence,
encapsulation.

Can a destructor be called directly?

1137

---

Why do we use encapsulation in oops?

1089

---

What is polymorphism used for?

1112

---

what is difference between class template and template class?

2715

---

write string class as your own class in java without using any built-in function

2555

---

Write a program to implement OOPS concepts such as inheritance, polymorphism, friend function, operator overloading?

4806

---

Is abstract thinking intelligence?

1110

---

How is class defined?

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

---

is there any choice in opting subjects like 4 out of 7

2247

---

How oops is better than procedural?

1150

---

write knight tour problem which is present in datastructure

2719

---

What is a null tree?

1192

---

What is class in oop with example?

1162

---

explain sub-type and sub class? atleast u have differ it into 4 points?

2364

---