assume the program must insert 4 elements from the key board
and then do the following programs.sequential search(search
one of the elements),using insertion sort(sort the element)
and using selection sort(sort the element).
2075
What is the difference between procedural programming and oops?
1063
Why can't we have instance(stack) of a class as a member of
the same class like eg.Class A{A obj;} as we can have self
refential pointer
2097
What is persistence in oop?
1100
What are different types of JVM's? for example we use dalvik jvm for android then what about the remaining operating systems?
2086
Where is pseudocode used?
1036
What is property in oops?
994
Whats oop mean?
993
#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.
3705
Can static class have constructor?
987
What is abstraction in oops with example?
1222
What are functions in oop?
999
What is polymorphism give a real life example?
980
What are objects in oop?
1041
What is advantage of inheritance?
1136
