Answer Posted / vishwa

Both are allocated in heap.
Also if any structure is declared in a function, the
function stack creates a heap from the stack. so these
structures in function allocates in heap.

How can you overcome the diamond problem in inheritance?

1228

---

Write a c++ program to display pass and fail for three student using static member function

3466

---

What is polymorphism and types?

1161

---

#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

---

What is multilevel inheritance in oop?

1089

---

What is encapsulation with example?

1200

---

How do you define social class?

1117

---

What is the difference between abstraction and polymorphism?

1158

---

program for insertion ,deletion,sorting in double link list

2749

---

Why do while loop is used?

1098

---

What are the 3 principles of oop?

1169

---

What is overriding in oops?

1158

---

What is new keyword in oops?

1099

---

i=20;k=0; for(j=1;k-i;k+=j<10?4:3) { cout<

1920

---

Why is encapsulation used?

1054

---