Ordinal Tree

From HandWiki
Revision as of 06:07, 6 March 2021 by imported>Unex (correction)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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]