A spaghetti stack is an N-ary tree data structure in which child nodes have pointers to the parent nodes (but not vice-versa)
Spaghetti stack structure is used in situations when records are dynamically pushed and popped onto a stack as execution progresses, but references to the popped records remain in use. Following are some applications of Spaghetti Stack.
Compilers for languages such as C create a spaghetti stack as it opens and closes symbol tables representing block scopes. When a new block scope is opened, a symbol table is pushed onto a stack. When the closing curly brace is encountered, the scope is closed and the symbol table is popped. But that symbol table is remembered, rather than destroyed. And of course it remembers its higher level “parent” symbol table and so on.
Spaghetti Stacks are also used to implement Disjoint-set data structure.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Stack Permutations (Check if an array is stack permutation of other)
- Infix to Postfix using different Precedence Values for In-Stack and Out-Stack
- Find maximum in stack in O(1) without using additional stack
- Sort a stack using a temporary stack
- Stack | Set 3 (Reverse a string using stack)
- Rat in a Maze | Backtracking using Stack
- Reverse a stack using recursion
- Implement Stack using Queues
- Reverse a number using stack
- Sort a stack using recursion
- How to create mergable stack?
- Stack | Set 2 (Infix to Postfix)
- Stack Class in Java
- Clone a stack without extra space
- Construct a BST from given postorder traversal using Stack