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

Answer Posted /

Is This Answer Correct ?    Yes No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

When the recid is generated, what is its utility?

211


why we need to measure 0.5 micron particals in clean room as used HEPA filters are having 99.97% efficincy.

2291


Please anyone guide where i can get the questions on Rational Test Real Time testing tool. Because i have to write exam on RTRT.

1983


What is iis server and how it works?

928


What is the latest version of edubuntu?

818


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

3767


What an i/o filter in java programming?

1105


What is quality audit?

1127


How do you feel when you are forced to do something at work that you don't want to do?

1390


What is database isolation in sql server? : sql server database administration

1110


How NameNode tackle Datanode failures in HDFS?

32


What are the differences between a primary key and foreign key?

1094


How many clustered indexes can you create for a table in dwh? In case of truncate and delete command what happens to table, which has unique id 347 what is hybrid slowly changing dimension?

1063


What is the purpose of _init_() function in python?

852


on a three-winding transformer relationship delta-delta-star, on third winding why the relationship is a star? what are the advantages and disadvantages? Thank you and please help

1735