???????????????????

????????? = ???????? ???????????. ????????????? ?????????????. ????????????????? ????e????????????????.
????????????????? ??????????????:
???????????????????????
????Stack push(Stack s?? int key)
????????????????? ??????????????????
????(1) ??? stack?? ????? push
????(2) ?????? stack?? ??? push ????
????(3) stack ??????? push ??????????????????
????(4) ?????? stack?? ??? push ??????
????(5) ?????? stack?? ??? push ??????
?????????????????????????????? ??????????????????????ο??? ?????????????.
??????Щ????????????????(????? use case testing ?? Equivalence Class Testing??????? ??????????????????????)?? ??????????????α????. ???????????????????????????.
???????????????????????????????
??????????? ????????????????????. ????????????????????????????????????С?????????.
?????????????????????? ????????????????????ж???? ?????????????????. ????: ????????е?????(statement); ????????????з?????.
???????????????е?????????? ????????????
????01: Stack push(Stack s?? int key)
????02: {
????03:     if(isFull(s)){
????04:        printf("Stack is full !! ");
????05:     }else{
????06:         s.top = s.top + 1;
????07:         s.element[s.top] = key;
????08:         printf("Success push %d in the Stack "?? key);
????09:     }
????10:     return s;
????11: }