Answer Posted / adarsh gupta

Function declaration -
*Requires semicolon,
*Contains actual parameters,
*Tells about the type of value returned by function,
*This unit can't be invoked from other parts of program.

Function definition-
*Don't require semi coloun,
*Contans the main part(main ligic) of the program,
*Can be invoked from other parts of program,
*Uses formal parameters.

What is ambiguity in inheritance?

1120

---

What are the 4 pillars of oop?

1148

---

What does sksksk mean in text slang?

2123

---

What is encapsulation c#?

1080

---

What is abstraction encapsulation?

1127

---

Why multiple inheritance is not allowed?

1158

---

What is the main purpose of inheritance law?

1199

---

How is class defined?

1140

---

What is the real time example of encapsulation?

1068

---

What is class and object in oops?

1145

---

can we make game by using c

4144

---

What is the significance of classes in oop?

1158

---

Why is there no multiple inheritance?

1003

---

How do you answer polymorphism?

1062

---

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

3761

---