Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01336941n
Noun Concept
Categories: Continuations, Trees (data structures)
EN
anti-arborescence  parent pointer tree  in-tree  cactus stack  saguaro stack
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
IS A
arborescence
polytree
DIFFERENT FROM
anti-arborescence
OPPOSITE OF
arborescence
STUDIED BY
graph theory
Wikipedia
EN
parent pointer tree
Wikidata
EN
anti-arborescence, parent pointer tree
Wikipedia Redirections
EN
cactus stack, saguaro stack, spaghetti stack
Wikidata Alias
EN
anti-arborescence, cactus stack, in-tree, saguaro stack, spaghetti stack

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License