Answer Posted / krishna chowdary garapati

Declaration means it exits but it has no meaning. But where
as definition means it has a meaning. Without decalration
there is no definition. Why means without existing how can
we use.
Some situations we do both in a single statement like,
int i = 10;
here i is declared and definie with the value 10;
But some languages give some value to the variable without
defining like
class DiffsDemo {
int i;
}

DiffsDemo demo = new DiffsDemo();
print: demo.i;
output: 0;

This will happen because some default values are assigned
to that types. Internally at run time they will define.

Where is pseudocode used?

1114

---

What is Difeerence between List obj=new ArrayList(); and ArrayList obj=new ArrayList()?

2545

---

What are constructors in oop?

1196

---

Can you inherit a private class?

1106

---

What is encapsulation selenium?

1020

---

What is overriding in oop?

1047

---

What is abstraction in oops?

1051

---

What is encapsulation in simple terms?

1045

---

Why is encapsulation used?

1002

---

How to hide the base class functionality in Inheritance?

1145

---

What does I oop mean?

1082

---

Can an interface inherit a class?

1069

---

What is meant by multiple inheritance?

1270

---

What are oops functions?

1038

---

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

3771

---