@prefix dcterms: <http://purl.org/dc/terms/> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix qudt: <http://qudt.org/schema/qudt/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix sh: <http://www.w3.org/ns/shacl#> .

qudt:OrderedTree a rdfs:Class,
        owl:Class,
        sh:NodeShape ;
    rdfs:label "Ordered Tree Type" ;
    dcterms:description """
  <p>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 <b>lt</b> or <b>gt</b>) that is used to order the nodes.
  </p>"""^^rdf:HTML ;
    rdfs:isDefinedBy <http://qudt.org/3.2.1/schema/datatype>,
        <http://qudt.org/3.2.1/schema/shacl/datatype> ;
    rdfs:subClassOf qudt:OrderedCollection,
        qudt:Tree .