Last active
August 16, 2019 18:39
-
-
Save devansh42/77957a40cb03249b744fac9ae35ffc37 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#ifndef STACK_H | |
#define STACK_H | |
/** | |
* Defination of Basic Stack Structure | |
*/ | |
typedef struct | |
{ | |
//size of stack | |
int size; | |
//capacity of queue | |
int cap; | |
//array to store are stack | |
int* ar; | |
} BasicStack; | |
/** | |
* This function returns pointer to basic stack structure | |
* cap, is the capacity of stack | |
*/ | |
BasicStack* new_basic_stack( int cap); | |
/** | |
* This function pushes an element in BasicStack, return 1 if succeed | |
* returns 0 if failed (Stack Overflow) | |
*/ | |
int push_basic_stack(BasicStack*,int element); | |
/** | |
* This function pops out an element in BasicStack, returns poped element | |
*/ | |
int pop_basic_stack(BasicStack*); | |
/** | |
* This function return top element of our stack without removing it | |
*/ | |
int top_basic_stack(BasicStack*); | |
/** | |
* This function deletes, basic stack structure and deallocates memory associated with them | |
*/ | |
void delete_basic_stack(BasicStack*); | |
#endif |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment