Resolve
RDF Terms

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

Recommended prefix

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

qudt:

lang:""
Ordered Tree Type
lang:""

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 lt or gt) that is used to order the nodes.