u r thriller
--- On Thu, 26/6/08, Tyler Littlefield <[EMAIL PROTECTED]> wrote: From: Tyler Littlefield <[EMAIL PROTECTED]> Subject: Re: [c-prog] hii i want programmes of link list ,stack and ques To: [email protected] Date: Thursday, 26 June, 2008, 8:28 AM google.com should give you a great answer. as for plzzzzzzzz. just looks like your falling asleep on the keyboard and makes me want to hit the delete key Thanks, ~~TheCreator~ ~ Visit TDS for quality software and website production http://tysdomain. com visit the piratecafe for programming related resources: http://piratecafe. net msn: [EMAIL PROTECTED] com skype: st8amnd127 ----- Original Message ----- From: prashant_rai14 To: [EMAIL PROTECTED] com Sent: Wednesday, June 25, 2008 10:08 AM Subject: [c-prog] hii i want programmes of link list ,stack and ques hii i want programmes of link list ,stack and ques so plzzz help me i want lot os programmes of these __________ NOD32 3219 (20080625) Information __________ This message was checked by NOD32 antivirus system. http://www.eset. com [Non-text portions of this message have been removed] Messages in this topic (2) Reply (via web post) | Start a new topic Messages | Files | Photos | Links | Database | Polls To unsubscribe, send a blank message to <mailto:[EMAIL PROTECTED]>. MARKETPLACE You rock! Blockbuster wants to give you a complimentary trial of - Blockbuster Total Access. Change settings via the Web (Yahoo! ID required) Change settings via email: Switch delivery to Daily Digest | Switch format to Traditional Visit Your Group | Yahoo! Groups Terms of Use | Explore your hobbies and interests. Go to http://in.promos.yahoo.com/groups/ ---------- #include<stdio.h> #include<conio.h> #include<process.h> #include<stdlib.h> #include<alloc.h> typedef struct stack { int data; struct stack *next; } node; void main() { node *top; int data,item,choice; char ans,ch; void push(int,node **); void display(node **); int pop(node **); int sempty(node *); clrscr(); top=NULL; printf("\n\t\t stack list using linked list"); do { printf("\n\n the main menu"); printf("\n 1.push\n 2.pop\n 3.display\n 4.exit\n"); printf("enter your choice"); scanf("%d",&choice); switch(choice) { case 1: printf("enter the data"); scanf("%d",&data); push(data,&top); break; case 2: if(sempty(top)) printf("\n stack under flow!"); else { item=pop(&top); printf("\n the poped node is %d",item); } break; case 3: display(&top); break; case 4: printf("\n do u want to quit?(y/n)"); ch=getch(); if(ch=='y') exit(0); else break; } printf("\n do u want to continue?"); ans=getch(); clrscr(); } while(ans=='y'||ans=='y'); getch(); } void push(int item,node **top) { node *new; node *get_node(int); new=get_node(item); new->next=*top; *top=new; } node *get_node(int item) { node *temp; temp=(node*)malloc(sizeof(node)); if(temp==NULL) printf("\n memory cannot be allocated"); temp->data=item; temp->next=NULL; return(temp); } int sempty(node*temp) { if(temp==NULL) return 1; else return 0; } int pop(node **top) { int item; node *temp; item=(*top)->data; temp=*top; *top=(*top)->next; free(temp); return(item); } void display(node **head) { node *temp; temp=*head; if(sempty(temp)) printf("\n the stack is empty"); else { while(temp!=NULL) { printf("%d\n",temp->data); temp=temp->next; } } getch(); } [Non-text portions of this message have been removed]
