Answer Posted / mani

int x = 15;
int y = 20;
System.out.println(x+" "+y);
x ^= y;
y ^= x;
x ^= y;
System.out.println(x+" "+y);

Advantage and disadvantage of routing in telecom sector

1310

---

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

2197

---

Why do we use encapsulation in oops?

1047

---

What is cohesion in oop?

1071

---

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

3773

---

What is abstraction in oop with example?

1141

---

What is abstraction with example?

1120

---

Why is it so that we can have virtual constructors but we cannot have virtual destructors?

4960

---

What is polymorphism what is it for and how is it used?

1023

---

What is encapsulation c#?

1091

---

What is abstraction in oops with example?

1301

---

What does oop mean in snapchat?

1251

---

What is class encapsulation?

1106

---

what is the drawback of classical methods in oops?

3385

---

What is static in oop?

1089

---