Traversable trees and forests

dc.contributor.author	Postma, Stef W.
dc.date.accessioned	2018-06-06T14:09:53Z
dc.date.available	2018-06-06T14:09:53Z
dc.date.issued	1988
dc.identifier.citation	S.W. Postma (1988) Traversable trees and forests. Quaestiones Informaticae Vol 6 No 2 1988	en
dc.identifier.issn	0254-2757
dc.identifier.uri	http://hdl.handle.net/10500/24292
dc.description.abstract	Two topics are studied, related and generalised in this paper - the Knuth transform of an arbitrary tree to a binary tree, and Pfaltz' s definition of a data structure as a graph with assignments. Trees are defined in terms of undirected graphs, and the binary tree is shown to be a data structure. And/or graphs are considered and generalised to fans which are shown to be Knuth transformable. A (presumably most) general structure which is Knuth transformable is then defined, a possible notation is suggested, and its implementation in Octolisp is indicated.	en
dc.language.iso	en	en
dc.publisher	Computer Society of South Africa (on behalf of SAICSIT)	en
dc.subject	Design	en
dc.subject	theory	en
dc.subject	language	en
dc.subject	undirected trees	en
dc.subject	abstract Knuth transform	en
dc.subject	fan structures	en
dc.subject	tree base data structures	en
dc.subject	Octolisp	en
dc.title	Traversable trees and forests	en
dc.type	Article	en
dc.description.department	School of Computing	en