Answer Posted / saranya

a class can have more than one method with same function
name but different in parameter passing is said to be
method overloading

What is Difference Between Inheritance and creating object and getting data? means Class A extends B{ B.getMethod();} (OR) Class A{ b obj=new B(); obj.getMethod(); }

2617

---

program for insertion ,deletion,sorting in double link list

2696

---

What are two types of polymorphism?

1078

---

Why do pointers exist?

1105

---

What is an interface in oop?

1052

---

What is pointer in oop?

1063

---

Write A Program to find the ambiguities in Multiple Inheritance? How are they resolved.(Virtual Functions)

4155

---

how to get the oracle certification? send me the answer

2162

---

What is encapsulation and abstraction? How are they implemented in C++?

1140

---

Whats is abstraction in oops?

1087

---

What is difference between data abstraction and encapsulation?

1090

---

Which is better struts or spring?

1062

---

IS IT NECESSARY TO INITIALIZE VARIABLE? WHAT IF THE INSTANCE VARIABLE IS DECLARED final ? IS IT NECESSARY TO INITIALIZE THE final VARIABLE AT THE TIME OF THEIR DECLARATION?

2075

---

design a c++ class for the chess board,provide a c++ class definition for such class(only class definition is required)

6684

---

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

3771

---