Ordinal Tree
   HOME

TheInfoList



OR:

{{one source , date=May 2024 An ordinal tree, by analogy with an
ordinal number In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, th, etc.) aimed to extend enumeration to infinite sets. A finite set can be enumerated by successively labeling each element with the leas ...
, 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" (2005) by David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman and S. Srinivasa Rao


See also

*
Cardinal tree A cardinal tree (or trie) of degree ''k'', by analogy with cardinal number In mathematics, a cardinal number, or cardinal for short, is what is commonly called the number of elements of a set. In the case of a finite set, its cardinal num ...


References

Data types Trees (data structures) Knowledge representation Abstract data types