Have you ever used threads?

3 Answers   Adobe, IBM,

---

What is the main feature of oop?

0 Answers  

---

When you define a integer it gets stored in which data structure?(Stack or a heap)

2 Answers   emc2,

---

What is polymorphism and its types?

0 Answers  

---

What are the benefits of oop?

0 Answers  

---

What is friend function?

12 Answers   Wipro,

---

3. Differentiate verification and validation.

1 Answers  

---

#include <stdio.h> #include <alloc.h> #include <stdlib.h> #include <conio.h> 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.

0 Answers  

---

what is the main difference between sizeof() operator in c and c++

3 Answers  

---

why function overloading is not called as pure polymorphism?

2 Answers  

---

When is an object created and what is its lifetime?

4 Answers   IBM,

---

What are the three main types of variables?

0 Answers  

---