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

qudt:Tree a rdfs:Class,
        owl:Class,
        sh:NodeShape ;
    rdfs:label "Tree Type" ;
    dcterms:description """
  A "Tree" is a data type that defines the properties of data structures that represent trees. 
  Each node is either a leaf or an internal node. 
  An internal node has one or more child nodes and is called the parent of its child nodes. 
  Leaf nodes have no chidren. Nodes that share the same parent are siblings. 
  In graph theoretic terminology, a tree is a connected, undirected, acyclic graph.
  """ ;
    rdfs:isDefinedBy <http://qudt.org/3.2.1/schema/datatype>,
        <http://qudt.org/3.2.1/schema/shacl/datatype> ;
    rdfs:subClassOf qudt:Graph ;
    prov:wasInfluencedBy <http://en.wikipedia.org/wiki/Tree_(data_structure)> .