Resolve
RDF Terms

Data based on @zazuko/vocabularies
Defined byqudt:
Click to Copy
qudt:BalancedTreeType
Click to Copy
http://qudt.org/schema/qudt/BalancedTreeType

Recommended prefix

Copy 'PREFIX qudt: <http://qudt.org/schema/qudt/>'

qudt:

rdf:type
owl:Class
rdfs:label
lang:""
Balanced Tree Type
rdfs:subClassOf
qudt:TreeType
dcterms:description
lang:""

A Balanced Tree Type 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.