Answer Posted / vic

To elaborate on Ejaz's answer, the run time determination
will only happen if the functions being called were declared
as being virtual.

If they weren't, then the function to be called will be
determined at compile time according to the object type.

What is byval and byref? What are differences between them?

2203

---

c++ program to swap the objects of two different classes

2395

---

What is abstraction oop?

1067

---

What is overloading in oops?

1144

---

What is encapsulation c#?

1063

---

What are the 5 oop principles?

1111

---

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

3740

---

What makes a language oop?

1034

---

What is basic concept of oop?

1149

---

What is the highest level of cohesion?

1023

---

What is oops with example?

1037

---

What is polymorphism explain its types?

1141

---

Write a program to reverse a string using recursive function?

2325

---

What is use of overloading?

1118

---

What is difference between data abstraction and encapsulation?

1067

---