Data Structure and algorithm analysis-stack, data structure and algorithm analysis

Source: Internet
Author: User

Data Structure and algorithm analysis-stack, data structure and algorithm analysis

Data Structure and algorithm analysis-stack (single-chain table implementation)

//by xiabodan#include <stdio.h>#include <stdlib.h>typedef int elementtype;typedef struct node *stack;typedef struct node *position;struct node {    elementtype data;    position next;};int isempty(stack S);void delete_stack(stack S);stack create_stack(void);elementtype top(stack S);elementtype pop(stack S);void push(stack S,elementtype data);int isempty(stack S){    return (S->next == NULL);}stack create_stack(void){    stack S;    S = (position)malloc(sizeof(struct node));    if( S == NULL)    {           printf("create_stack : out of space");        return ;    }    S->next = NULL; // S->next is top of stack ,because header can't store element    return  S;}void delete_stack(stack S){     if(S == NULL)        printf("S is a empty stack!\n");     else      {        while( !isempty( S))            pop(S);     }}elementtype pop(stack S){    elementtype data;    if(!isempty(S))    {        position tem;        tem = S->next;//tem  point to the top node        data = S->next->data;        S->next = tem->next;//also S->next = S->next->next        free(tem);        return data;    }    else         printf("pop : empty stack!\n");    return 0;}elementtype top(stack S){    if(!isempty(S))        return (S->next->data);    printf("top : empty stack!\n");    return 0;}void push(stack S,elementtype data){    position P;    P = (position)malloc(sizeof(struct node));    if( P == NULL)    {           printf("push : out of space");        return ;    }    P->data = data;        P->next = S->next;  //compare list , insert node location the first node here,but insert node anywhere in list    S->next = P;}int main(int argc ,char** argv){    stack S;    int i = 0 ;    elementtype data;    S = create_stack();    printf("push 10 datas from 0 to 9 \n");    for(i=0;i<10;i++)    {        push(S,i);    }    printf("S is empty? %d \n",isempty( S));    printf("pop 5 datas \n");    for(i=0;i<5;i++)    {        data = pop(S);        printf("pop data is : %d\n",data);    }    printf("push 2 datas 11,12\n");    push(S,11);    push(S,12);    printf("pop all remain datas \n");    while(!isempty( S))    {        data = pop(S);        printf("pop data is : %d\n",data);    }    printf("S is empty? %d \n",isempty( S));    delete_stack(S);}

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.