Jump to content

Ordinal tree

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Allforrous (talk | contribs) at 11:05, 30 August 2018 (new key for Category:Trees (data structures): "*" using HotCat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

An ordinal tree [1], 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.

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=857227774"