This is an old revision of this page, as edited by Lejyby(talk | contribs) at 19:10, 9 April 2018(first draft of a definition of an ordinal tree.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 19:10, 9 April 2018 by Lejyby(talk | contribs)(first draft of a definition of an ordinal tree.)
An ordinal tree[1] 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.
^"Representing Trees of Higher Degree" [1], by Benoit, Demaine, J. Ian Munro, Raman, Raman and Rao
