Saguaro Stack
In computer science, an in-tree or parent pointer tree is an -ary tree data structure in which each node has a pointer (computer programming), pointer to its parent node, but no pointers to child nodes. When used to implement a set of Stack (abstract data type), stacks, the structure is called a spaghetti stack, cactus stack or saguaro stack (after the saguaro, a kind of cactus). Parent pointer trees are also used as disjoint-set data structures. The structure can be regarded as a set of singly linked lists that structure sharing, share part of their structure, in particular, their tails. From any node, one can traverse to ancestors of the node, but not to any other node. Use in compilers A compiler for a language such as C (programming language), C creates a spaghetti stack as it opens and closes symbol tables representing block Scope (computer science), scopes. When a new block scope is opened, a symbol table is pushed onto a stack. When the closing curly brace is encountered, ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]