Answer Posted / partha

if u can bag global certifications along with good
knowledge geting a job is not much dificult however only
on gniit and bscit basis it is quite dificult and salary
will als be very marginal and its depened upon your skill

What is class and example?

1093

---

What is the full form of oops?

1124

---

why reinterpret cast is considered dangerous?

2337

---

What is abstraction example?

1044

---

Why do we use class in oops?

916

---

What is cohesion in oop?

1010

---

What is encapsulation c#?

1015

---

What is destructor in oop?

989

---

what type of questions

2068

---

What are the three main types of variables?

1065

---

Which language is pure oop?

943

---

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

3703

---

How do you define a class in oop?

1065

---

What is overloading and its types?

1084

---

What is abstraction oop?

1030

---