Dynamically linked stacks
Download as PPTX, PDF0 likes449 views
This document describes dynamically linked stacks which allow for adding and removing elements from multiple stacks. It discusses using a linked list structure with Stack nodes that point to the top element of each stack. Elements can be added by creating a new Stack node, assigning its item field, and updating the top pointer. Elements are removed by saving the top item, updating top to point to the next node, and returning the item. This allows efficient insertion and removal from multiple stacks using linked lists.
![Dynamically Linked Stacks
• Linked Stack
int MAX_STACKS 10; /* maximum number of stacks */
Class Element{
int key;
/* other fields */
}
Class Stack{
element item;
Stack link;
}
Stack top[MAX_STACKS];](https://image.slidesharecdn.com/dynamicallylinkedstacks-131215090237-phpapp01/85/Dynamically-linked-stacks-2-320.jpg)
Dynamically linked stacks
- 1. Dynamically Linked Stacks Steve Paks
- 2. Dynamically Linked Stacks • Linked Stack int MAX_STACKS 10; /* maximum number of stacks */ Class Element{ int key; /* other fields */ } Class Stack{ element item; Stack link; } Stack top[MAX_STACKS];
- 3. Dynamically Linked Stacks(Cont’d) • Add to a Linked Stack void add(Stack top, Element item){ Stack temp = new Stack(); if(IS_FULL(temp)){ print(“The memory is full”); exit(1); } temp.item = item; temp.link = top; ∙∙∙∙ (a) top = temp; ∙∙∙∙ (b) } (a) item temp top (b) item top
- 4. Dynamically Linked Stacks(Cont’d) • delete from a Linked Stack Element delete(){ Stack temp = top; Element item; if(IS_EMPTY(temp)){ print(“The Stack is empty”); exit(1); } item = temp.item; ∙∙∙∙ (a) top = temp.link; ∙∙∙∙ (b) return item; } top (a) a item a temp (b) top