{"version":"1.0","type":"link","title":"Parent pointer tree - Newikis","description":"In computer science, an in-tree or parent pointer tree is an N-ary tree data structure in which each node has a pointer to its parent node, but no pointers to child nodes. When used to implement a set of stacks, the structure is called a spaghetti stack, cactus stack or saguaro stack (after the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/e/e5/Spaghettistack.svg/1280px-Spaghettistack.svg.png","thumbnail_width":1280,"thumbnail_height":2952}