what is the size of an empty class

Answer Posted / hardit singh

size of an empty class is 1 byte

Is This Answer Correct ?    32 Yes 3 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is difference between pop and oop?

609


What is coupling in oops?

598


What are the components of marker interface?

602


which feature are not hold visual basic of oop?

1725


What is multilevel inheritance explain with example?

628






What is the real life example of polymorphism?

609


What is the difference between a constructor and a destructor?

614


There are two base class B1,B2 and there is one class D which is derived from both classes, Explain the flow of calling constructors and destructors when an object of derived class is instantiated.

1459


What is the problem with multiple inheritance?

586


What are the 3 pillars of oop?

616


explain sub-type and sub class? atleast u have differ it into 4 points?

1837


write a program to find 2 power of a 5digit number with out using big int and exponent ?

1895


any one please tell me the purpose of operator overloading

1967


Please send ford technologies placement paper 2 my mail id

1658


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

3254