EN

tree tree diagram tree structure Child node directed tree

EN

EN

tree tree diagram tree structure Child node directed tree

EN

Definitions

Examples

Relations

Sources

EN

In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph.
Wikipedia

A tree structure, tree diagram, or tree model is a way of representing the hierarchical nature of a structure in a graphical form.
Wikipedia

A connected undirected graph without simple cycles
Wikipedia Disambiguation

A connected graph without cycles
Wikipedia Disambiguation

A way of representing the hierarchical nature of a structure in a graphical form
Wikipedia Disambiguation

Undirected, connected and acyclic graph
Wikidata

A connected graph with no cycles or, if the graph is finite, equivalently a connected graph with n vertices and n−1 edges.
Wiktionary

EN

PART OF

HAS KIND

DEPICTED BY

DERIVATIVE WORK

DIFFERENT FROM

DOES NOT HAVE PART

MANIFESTATION OF

NAMED AFTER

OPPOSITE OF

PARTIALLY COINCIDENT WITH

STUDIED BY

USE

WordNet 3.0 & Open English WordNet

EN

Wikipedia

Wikidata

EN

Wiktionary

EN

Wikipedia Redirections

EN

Child node (of a tree),
directed tree,
forest (graph theory),
free tree,
graph-theoretical tree,
Graph theoretical tree,
hierarchical tree structure,
labeled tree,
Labelled tree,
leaf (graph theory),
Locally finite rooted tree,
ordered tree,
root (graph theory),
Rooted hierarchical tree structure,
Rooted plane tree,
rooted tree,
Tree (graph),
tree graph,
Tree Structure