How do you implement stack using linked list in turbo c?

Answer 1

Assume the Linked list has following operations

1.node* insert(node* node, bool head); /* head = true if insertion at head else insertion at tail */

2. node* remove(bool head); /* head = true if removal at head else removal at tail */

Now implement the stack functions as below.

STK_RET push(node* pnode)

{

node* head;

head = insert(pnode, true); /* insert the node at head */

if (head)

return STK_OK;

else

return STK_NOK;

}

similarly pop can be implemented to remove the node at head

Also the conventioin of inserting and removal from the tail can be used.