Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Tell us about yourself.

Answer Posted / karthik raja

I AM KARTHIK, i have completed DCE COMPUTER in MURUGA
POLYTECHNIC COLLEGE in KALAKURICHI.I have done my 12th
standard in Govt Higher Se-country School in Sankarapuram.My
Father Mr. Rajaendran, He is a Former My Mother R.
Periyanayagam, She IS a Home Maker. My Elder Sister Working
in Teacher,I have a younger brother He is Doing ECE in
krishnagiri.My Hobbies Plying Cricket kapadi and Watching TV
and Reading Books. I am very self postitive passion. I am a
Hard worker.

Is This Answer Correct ?    1 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What does and I oop mean in text?

1124


What does no cap mean?

1011


when to use 'mutable' keyword and when to use 'const cast' in c++

2114


Which is not an object oriented programming language?

941


What is abstraction example?

1047


what is difference between class template and template class?

2598


What is meant by oops concept?

992


What are oops methods?

947


hi all..i want to know oops concepts clearly can any1 explain??

2083


State what is encapsulation and friend function?

1193


Why is oop useful?

1038


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

3704


What is class and object with example?

1061


What is new keyword in oops?

996


What is the difference between inheritance and polymorphism?

1053