Cardinal Tree

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

A cardinal tree (or trie) of degree k[1], 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. 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.


  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]