Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Rooted_binary_tree> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Rooted_binary_tree abstract "In computer science, a rooted binary tree is a tree with a root node in which every node has at most two children. A rooted binary tree is a tree with a root which has degree 2 and all other nodes of degree 3.".
- Rooted_binary_tree wikiPageID "33331755".
- Rooted_binary_tree wikiPageRevisionID "605008283".
- Rooted_binary_tree hasPhotoCollection Rooted_binary_tree.
- Rooted_binary_tree subject Category:Trees_(data_structures).
- Rooted_binary_tree comment "In computer science, a rooted binary tree is a tree with a root node in which every node has at most two children. A rooted binary tree is a tree with a root which has degree 2 and all other nodes of degree 3.".
- Rooted_binary_tree label "Rooted binary tree".
- Rooted_binary_tree sameAs m.01d18.
- Rooted_binary_tree sameAs Q7366594.
- Rooted_binary_tree sameAs Q7366594.
- Rooted_binary_tree wasDerivedFrom Rooted_binary_tree?oldid=605008283.
- Rooted_binary_tree isPrimaryTopicOf Rooted_binary_tree.