qudt:OrderedTree
http://qudt.org/schema/qudt/OrderedTree
| Predicate | Object |
|---|---|
rdf:type |
owl:Class |
rdf:type |
rdfs:Class |
rdf:type |
sh:NodeShape |
dcterms:description |
An "Ordered Tree Type" is a data type that defines the properties of data structures that represent ordered trees. An ordered tree is a tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc. Typically a type specification for an ordered tree will include the comparison operator (such as lt or gt) that is used to order the nodes. |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/datatype |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/shacl/datatype |
rdfs:label |
“Ordered Tree Type” |
rdfs:subClassOf |
qudt:OrderedCollection |
rdfs:subClassOf |
qudt:Tree |
Generated 2026-09-22T13:15:48.343+00:00