Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01427142n
Noun Concept
Categories: Trees (graph theory), Trees (data structures)
EN
k-ary tree  m-ary tree  K-ary trees  k-way tree  N-ary tree
EN
In graph theory, an m-ary tree is an arborescence in which each node has no more than m children. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, an m-ary tree is an arborescence in which each node has no more than m children. Wikipedia
Tree data structure in which each node has at most K children Wikidata
IS A
arborescence
ordered tree
rose tree
HAS KIND
and–or tree
ternary tree
binary tree
STUDIED BY
graph theory
Wikipedia
EN
m-ary tree
Wikidata
EN
k-ary tree
Wikipedia Redirections
EN
K-ary tree, K-ary trees, k-way tree, N-ary tree
Wikidata Alias
EN
k-way tree

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License