Rose tree
From Infogalactic: the planetary knowledge core
<templatestyles src="Module:Hatnote/styles.css"></templatestyles>
In computing, a multi-way tree or rose tree is a tree data structure with a variable and unbounded number of branches per node.[1][better source needed] The name rose tree for this structure is prevalent in the functional programming community, e.g., in the context of the Bird–Meertens formalism.[2] It was coined by Lambert Meertens to evoke the similarly-named, and similarly-structured, common rhododendron.[3]
Definition
The following is a definition in Haskell:
data RoseTree a = RoseTree a [RoseTree a]
Sources
- ↑ Haskell Wiki, accessed 26 January 2012
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
External links
- Rose tree on the Haskell wiki
- Bayesian Rose Trees
- Data.Tree, an implementation of basic rose tree operations in the Haskell containers package
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
