Cardinal tree
 | This article relies on a single source. (May 2024) |
A cardinal tree (or trie) of degree k, by analogy with cardinal numbers and by opposition with ordinal trees, is a rooted tree in which each node has k positions for an edge to a child.[1] Each node has up to k children and each child of a given node is labeled by a unique integer from the set {1, 2, . . . , k}. For instance, a binary tree is a cardinal tree of degree 2.
See also
[edit]References
[edit]- ↑ "Representing trees of higher degree" (2005) by David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman and S. Srinivasa Rao
 | This computer science article is a stub. You can help Wikipedia by adding missing information. |