Ordinal tree
An ordinal tree, by analogy with an ordinal number, is a rooted tree of arbitrary degree in which the children of each node are ordered, so that one refers to the ith child in the sequence of children of a node.[1]
This is an old revision of this page, as edited by Filipović Zoran (talk | contribs) at 23:36, 15 May 2019. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
An ordinal tree, by analogy with an ordinal number, is a rooted tree of arbitrary degree in which the children of each node are ordered, so that one refers to the ith child in the sequence of children of a node.[1]