Resolve
RDF Terms

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

Recommended prefix

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

qudt:

rdf:type
owl:Class
rdfs:label
lang:""
Tree Type
rdfs:subClassOf
qudt:Graph
dcterms:description
lang:""
A "Tree" is a data type that defines the properties of data structures that represent trees. A tree is a graph data structure accessed beginning at the root node. 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.
prov:wasInfluencedBy
rdfs:isDefinedBy