toIPA
Home
Blog
Category
K-ary tree
Tree data structure in which each node has at most K children. From a graph theoretical perspective, k-ary trees are actually arborescences.
Pronunciation
/keɪ - ˈɛri tri/
Categories
ordered tree
multi-way tree
rooted tree