`qudt:BalancedTree`

http://qudt.org/schema/qudt/BalancedTree

Incoming relations

Types: owl:Class, rdfs:Class, sh:NodeShape

Predicate	Object
`rdf:type`	`owl:Class`
`rdf:type`	`rdfs:Class`
`rdf:type`	`sh:NodeShape`
`dcterms:description`	A Balanced Tree 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.
`rdfs:isDefinedBy`	http://qudt.org/3.5.2/schema/datatype
`rdfs:isDefinedBy`	http://qudt.org/3.5.2/schema/shacl/datatype
`rdfs:label`	“Balanced Tree Type”
`rdfs:subClassOf`	`qudt:Tree`
`rdfs:subClassOf`	`rdf:type` `owl:Restriction` `owl:maxCardinality` 1 `owl:onProperty` `qudt:maxDepth`
`sh:property`	`qudt:BalancedTree-maxDepth`

Generated 2026-09-22T13:15:48.343+00:00