Live briefing
Everything about Parent pointer tree
Tree data structure
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. Parent pointer trees are also used as disjoint-set data structures. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Parent pointer treeA 5-minute orientation
- Pick up a classic book: Data structures & algorithms in JavaThe most-reprinted book on the subject
- Go sideways: Closure (computer programming)A closely related topic
- Go sideways: Scope (computer programming)A closely related topic
📖 Definitions
Noun Synonym of in-tree.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Data structures & algorithms in JavaRobert Lafore · 2003
Allergies sourcebookAnnemarie Muth · 2002
The Art Of OS/2 Warp ProgrammingKatheleen Panov, Larry Salomon Jr., Arthur Panov · 1995
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Closure (computer programming) In programming languages, a closure, also lexical closure or function closure, is a technique for implementing lexically scoped name binding in a language…
- Scope (computer programming) In computer programming, the scope of a name binding (an association of a name to an entity, such as a variable) is the part of a program in which the…
- Call stack In computer science, a call stack is a stack data structure that stores information about the active subroutines and inline blocks of a computer program…
- Recursion (computer science) In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same…
- Pattern matching In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast…
- Funarg problem In computer science, the funarg problem (function argument problem) is the difficulty in implementing first-class functions (functions as first-class objects)…
- Binary expression tree A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binary expression tree…
- Syntax (programming languages) The syntax of computer source code is code structured and ordered restricted to computer language rules. Like a natural language, a computer language (i…