Answer Posted / kanthi

Well, there are many. A few to mention:
* Does not provide very strong type-checking. c++ code is
easily prone to errors related to data types, their
conversions, for example, while passing arguments to
functions.
* Does not provide efficient means for garbage collection,
as already mentioned.
* No built in support for threads.
* Gets complex when u want to develop a graphics rich
application in c++
* portability of code on various platforms, etc

can inline function declare in private part of class?

4497

---

What is polymorphism in oop example?

1070

---

Following are the class specifications: class {int a}; class {int b}; Using friend funtion,calculate the max of two objects and display it.

2509

---

Explain the advantages of inheritance.

1194

---

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

4211

---

What are oops functions?

1078

---

Why we use classes in oop?

1097

---

What are the three main types of variables?

1178

---

Why is oop useful?

1170

---

What is the purpose of polymorphism?

1173

---

What are objects in oop?

1155

---

What is a null tree?

1192

---

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

3829

---

What is the renewal class?

2823

---

What is oops in simple words?

1166

---