Matches in DBpedia 2014 for { <http://dbpedia.org/resource/K-ary_tree> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- K-ary_tree abstract "In graph theory, a k-ary tree is a rooted tree in which each node has no more than k children. It is also sometimes known as a k-way tree, an N-ary tree, or an M-ary tree. A binary tree is the special case where k=2.".
- K-ary_tree wikiPageExternalLink page257.html.
- K-ary_tree wikiPageID "2145273".
- K-ary_tree wikiPageRevisionID "593663149".
- K-ary_tree hasPhotoCollection K-ary_tree.
- K-ary_tree subject Category:Trees_(graph_theory).
- K-ary_tree comment "In graph theory, a k-ary tree is a rooted tree in which each node has no more than k children. It is also sometimes known as a k-way tree, an N-ary tree, or an M-ary tree. A binary tree is the special case where k=2.".
- K-ary_tree label "K-ary tree".
- K-ary_tree sameAs m.06q2wb.
- K-ary_tree sameAs Q6322804.
- K-ary_tree sameAs Q6322804.
- K-ary_tree wasDerivedFrom K-ary_tree?oldid=593663149.
- K-ary_tree isPrimaryTopicOf K-ary_tree.