Where *topo is a pointer to the first element in the stack. When you`re going to add a new one you verify if the stack is full, if it ins`t you put the data in a position in the stack and change the *topo. When removing, you decrement one in pointer *topo. Then it will reference the element that was there before.

(I had an enunciation but it was too big to translate)

stack with pointers implementation!

Regards,
Matheus

PS: You can see the enunciation in portuguese and then use google translate to translate it

This semester I have data structure class, my professor Aldo Von Wangenheim, decided to use C in the first part of the class, and in the end C++. If you don’t know it, he recommended this C course. He asked us to solve some exercices. Me and my colleague solved it and I’m uploading it here.

5 exercices for begginers (Portuguese)
Implementation of exercices

Regards,
Matheus

PS: I start translating “all” old posts. Maybe this old ones, don’t have all stuffs translated (like attachments in this one)