Английская Википедия:Cardinal tree

Материал из Онлайн справочника
Версия от 02:15, 15 февраля 2024; EducationBot (обсуждение | вклад) (Новая страница: «{{Английская Википедия/Панель перехода}} 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 {{Var|k}} positions for an edge to a child.<ref> "Representing trees of higher degree" (2005) by David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman and S. Srinivasa Rao [http://erikdemaine.or...»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)
Перейти к навигацииПерейти к поиску

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 Шаблон:Var positions for an edge to a child.[1] Each node has up to Шаблон:Var 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.

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]