What are stacks in C programming?
Stacks are a data structure that follows the Last In First Out (LIFO) principle, used for storing data.
How do you implement a stack in C?
You can implement a stack using an array or a linked list. Would you like an example of either?
Yes, please provide an example using an array.
Here's a simple implementation of a stack using an array:
#define MAX 100
int stack[MAX];
int top = -1;
void push(int value) {
if (top < MAX - 1) {
stack[++top] = value;
} else {
printf("Stack Overflow\n");
}
}
int pop() {
if (top >= 0) {
return stack[top--];
} else {
printf("Stack Underflow\n");
return -1;
}
}
What are the common operations performed on a stack?
The common operations are push (to add an item), pop (to remove an item), and peek (to view the top item without removing it).
Get this answer and more from ChatGPT in Telegram, try it for free!
Get Started For FreePowered by advanced language models trained on billions of online words and conversations, MagicBuddy delivers friendly and helpful chat on demand.
Ask questions and get answers. Crack jokes and get laughs. Or even get writing ideas and study help. MagicBuddy's conversational intelligence allows for a truly unique and useful chat experience.
Curious? Try these prompts:
MagicBuddy is incredibly easy to use and the responses are lightning fast! 🥇
Impressive! MagicBuddy is my go-to AI assistant. It’s quick, accurate, and user-friendly.
Sending voice messages makes it easier to use in the middle of the day and the answers are super fast.
Love it! A friend of mine told me about it and it has made my life so much easier. It’s like having a helpful friend in my pocket!
I use 2 months already, simply amazing! MagicBuddy delivers answers in a snap. It’s a must-have tool for staying informed!
Game-changer! MagicBuddy’s speed and accuracy are unmatched. It’s my secret weapon for productivity
Say Hello to Your New Telegram BFF - Try MagicBuddy Free!
Get Started For Free