qudt:BinaryTree
http://qudt.org/schema/qudt/BinaryTree
| Predicate | Object |
|---|---|
rdf:type |
owl:Class |
rdf:type |
rdfs:Class |
rdf:type |
sh:NodeShape |
dcterms:description |
A Binary Tree is a data type that defines the properties of data structures that represent binary trees. A binary tree is a tree in which each node has at most 2 children. |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/datatype |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/shacl/datatype |
rdfs:label |
“Binary Tree Type” |
rdfs:subClassOf |
qudt:Tree |
Generated 2026-09-22T13:15:48.343+00:00