SELECT ?property ?value WHERE { BIND (?? AS ?s) ?s ?property ?value . FILTER (isLiteral(?value)) } LIMIT 1000

Attributes

Tree Type
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.
SELECT ?property ?object WHERE { BIND (?? AS ?s) ?s ?property ?object . FILTER (isIRI(?object)) FILTER (?property != rdf:type) FILTER (?property != rdfs:subClassOf) } LIMIT 1000

Outgoing Relationships

property object
isDefinedBy QUDT SCHEMA - Datatypes
wasInfluencedBy Tree_(data_structure)
SELECT ?property ?subject WHERE { BIND (?? AS ?o) ?subject ?property ?o . FILTER (?property != rdf:type) FILTER (?property != rdfs:subClassOf) } LIMIT 1000
Incoming Relationships: No results found.
SELECT ?instance ?description WHERE { BIND (?? AS ?class) ?instance (rdf:type|owl:type) ?class . OPTIONAL { ?instance schema:description ?description . } } LIMIT 5000
Instances of this Class: No results found.
SELECT ?superclass ?description WHERE { ?? rdfs:subClassOf ?superclass . OPTIONAL { ?superclass (rdfs:comment|schema:description) ?description . } } LIMIT 5000

Superclasses of this Class

superclass description
Graph
SELECT ?subclass ?description WHERE { ?subclass rdfs:subClassOf ?? . OPTIONAL { ?subclass (rdfs:comment|schema:description) ?description . } } LIMIT 5000

Subclasses of this Class

subclass description
Balanced Tree Type
Binary Tree Type
Ordered Tree Type
Composition Tree