Jump to content

Category:Trees (data structures)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 84.4.83.145 (talk) at 20:18, 15 May 2006 (fr:). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In graph theory, a tree is a graph in which any two points, or vertices, are connected by exactly one path (i.e. there are no cycles). A forest is a graph in which any two vertices are connected by at most one path. An equivalent definition is that a forest is graph of one or more (unconnected) trees (hence the name). Trees are useful abstract structural representations of many different concepts.

Subcategories

This category has the following 5 subcategories, out of 5 total.

B

D

H

R

S

Pages in category "Trees (data structures)"

The following 120 pages are in this category, out of 120 total. This list may not reflect recent changes.

 

A

B

C

D

E

F

G

H

I

K

L

M

N

O

P

Q

R

S

T

V

W

X

Y

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Trees_(data_structures)&oldid=53378224"