Hierarchical visitor pattern: Difference between revisions
Content deleted Content added
m {{comp-sci-stub}} |
Uwe Hermann (talk | contribs) Link to Visitor pattern. |
||
| Line 1: | Line 1: | ||
In [[software engineering]], the '''hierarchical visitor pattern''' is one of [[design pattern (computer science)|design patterns]] that intend to provide a way to visit every node in the hierarchical [[data structure]] such as a [[tree data structure|tree]]. |
In [[software engineering]], the '''hierarchical visitor pattern''' is one of [[design pattern (computer science)|design patterns]] that intend to provide a way to visit every node in the hierarchical [[data structure]] such as a [[tree data structure|tree]]. |
||
== |
== See also == |
||
* [[Visitor pattern]] |
|||
| ⚫ | |||
== External links == |
|||
| ⚫ | |||
{{comp-sci-stub}} |
{{comp-sci-stub}} |
||
Revision as of 19:40, 3 August 2005
In software engineering, the hierarchical visitor pattern is one of design patterns that intend to provide a way to visit every node in the hierarchical data structure such as a tree.
See also
External links
 | This computer science article is a stub. You can help Wikipedia by expanding it. |