Answer Posted / mayuri

C C++

DATA IS NOT SECURED SECURED

TOP DOWN BOTTOM-UP

FOCUS ON PROCEDURES FOCUS ON DATA

PROGRAMS ARE DECOMPOSED INTO OBJECTS
INTO FUNCTIONS

allocation is done NEW OPERATOR
with malloc statement

UNOINS AND ENUMS AVALIABLE
ARE NOT AVALIABLE

DOES NOT PROVIDE PROVIDES
DEFAULT ARGUMENTS

Can a varargs method be overloaded?

1157

---

what are the different types of qualifier in java?

2321

---

What is abstraction example?

1158

---

What does and I oop mean in text?

1316

---

What is oops and why we use oops?

1098

---

is there any choice in opting subjects like 4 out of 7

2247

---

What is difference between pop and oop?

1237

---

What is overriding vs overloading?

1111

---

What is the problem with multiple inheritance?

1238

---

What is a class oop?

1058

---

What is new keyword in oops?

1099

---

When not to use object oriented programming?

1182

---

What is static modifier?

1330

---

Why do we use polymorphism in oops?

1109

---

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

3830

---