Jump to content

Ordinal tree

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BD2412 (talk | contribs) at 19:52, 29 June 2023 (→top: clean up spacing around commas and other punctuation, replaced: , → , (4)). 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]

See also

References

  1. ^ "Representing trees of higher degree" (2005) by David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman and S. Srinivasa Rao [1] [2]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Ordinal_tree&oldid=1162542860"