Answer Posted / siva

data are wrapped in a single unit which is calld class.The
above process is calld data binding.There are two types of
bindings:1)static binding 2)dynamic binding.

Which method cannot be overridden?

1100

---

How do you explain polymorphism?

1080

---

What are the benefits of oop?

1264

---

What is the use of oops?

1066

---

Why can't we have instance(stack) of a class as a member of the same class like eg.Class A{A obj;} as we can have self refential pointer

2157

---

why reinterpret cast is considered dangerous?

2394

---

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

3767

---

write a programe to calculate the simple intrest and compund intrest using by function overlading

2207

---

What is meant by multiple inheritance?

1266

---

What is the main purpose of inheritance law?

1199

---

What language is oop?

1013

---

Why do we use class in oops?

967

---

what is graphics

2466

---

Why do we use oops?

1024

---

how to get the oracle certification? send me the answer

2162

---