18 lines
635 B
Markdown
18 lines
635 B
Markdown
---
|
|
title: "Cardinal tree"
|
|
chunk: 1/1
|
|
source: "https://en.wikipedia.org/wiki/Cardinal_tree"
|
|
category: "reference"
|
|
tags: "science, encyclopedia"
|
|
date_saved: "2026-05-05T11:31:38.992204+00:00"
|
|
instance: "kb-cron"
|
|
---
|
|
|
|
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. 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 ==
|
|
Ordinal tree
|
|
|
|
|
|
== References == |