Matches in DBpedia 2014 for { <http://dbpedia.org/resource/(a,b)-tree> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- (a,b)-tree abstract "In computer science, an (a,b) tree is a specific kind of search tree. An (a,b) tree has all of its leaves at the same depth, and all internal nodes except for the root have between and children, where and are integers such that . The root has, if it is not a leaf, between 2 and b children.".
- (a,b)-tree wikiPageID "4436119".
- (a,b)-tree wikiPageRevisionID "575757318".
- (a,b)-tree hasPhotoCollection (a,b)-tree.
- (a,b)-tree subject Category:Trees_(data_structures).
- (a,b)-tree comment "In computer science, an (a,b) tree is a specific kind of search tree. An (a,b) tree has all of its leaves at the same depth, and all internal nodes except for the root have between and children, where and are integers such that . The root has, if it is not a leaf, between 2 and b children.".
- (a,b)-tree label "(a,b)-tree".
- (a,b)-tree sameAs (a,b)-strom.
- (a,b)-tree sameAs m.0c28gn.
- (a,b)-tree sameAs Q4544940.
- (a,b)-tree sameAs Q4544940.
- (a,b)-tree wasDerivedFrom (a,b)-tree?oldid=575757318.
- (a,b)-tree isPrimaryTopicOf (a,b)-tree.