@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#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

qudt:BalancedTree a rdfs:Class,
        owl:Class,
        sh:NodeShape ;
    rdfs:label "Balanced Tree Type" ;
    dcterms:description """
  <p>A <em>Balanced Tree</em> is a data type that defines the properties of data structures that represent balanced trees. 
  A balanced tree is a tree where no leaf is much farther away from the root than any other leaf. 
  Different balancing schemes allow different definitions of "much farther" and different amounts of work to keep them balanced.
  </p>
  """^^rdf:HTML ;
    rdfs:isDefinedBy <http://qudt.org/3.2.1/schema/datatype>,
        <http://qudt.org/3.2.1/schema/shacl/datatype> ;
    rdfs:subClassOf [ a owl:Restriction ;
            owl:maxCardinality 1 ;
            owl:onProperty qudt:maxDepth ],
        qudt:Tree ;
    sh:property qudt:BalancedTree-maxDepth .