Jump to content

Ordinal tree

Add links
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Fuddle (talk | contribs) at 19:39, 19 July 2024 (new key for Category:Trees (data structures): "" using HotCat). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

[edit]

References

[edit]
  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=1235533180"