what are the realtime excercises in C++?
2535
What is the difference between a constructor and a destructor?
838
What is destructor oops?
827
What is polymorphism and why is it important?
755
What is encapsulation with real life example?
777
What is and I oop mean?
829
What does sksksk mean in text slang?
1816
What is the importance of oop?
826
What causes polymorphism?
802
INSTANCE FIELDS DECLARED private ARE ACCESSIBLE BY THE
METHODS ONLY.CAN WE CHANGE THE private FIELD OF AN OBJECT IN
A METHOD OF SOME OTHER OBJECT OF THE SAME CLASS?
1871
#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.
3501
What is difference between pop and oop?
790
i=20;k=0;
for(j=1;k-i;k+=j<10?4:3)
{
cout<
1629
How can you overcome the diamond problem in inheritance?
952
How Do you Code Composition and Aggregation in C++ ?
24687
