Ordinal Tree
From Handwiki 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
- Cardinal tree
References
- ↑ "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]
 |  |
Categories: [Data types] [Trees (data structures)] [Knowledge representation] [Abstract data types]
↧ Download as ZWI file | Last modified: 09/19/2024 00:32:06 | 2 views
☰ Source: https://handwiki.org/wiki/Ordinal_tree | License: CC BY-SA 3.0
✘
ZWI is not signed. [what is this?]
ZWI viewer
by the 
KSF
KSF