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.

Articles in category "Trees (structure)"

There are 63 articles in this category.

Tree data structure 2 2-3-4 trees A A* search algorithm AA tree AVL tree Abstract syntax tree B B plus tree B*-tree B-tree Best-first search Bethe lattice Binary heap Binary search tree Binary space partitioning Binary tree Binomial heap Boruvka's algorithm Breadth-first search C Child node D Dancing tree Decision tree

D cont. Dendrogram Depth-first search E Expectiminimax tree Exponential tree F Fibonacci heap Fusion tree G Game tree H Heap I Internal node Iterative deepening depth-first search K Kd-tree Kruskal's algorithm König's lemma L Leaf node M Minimum spanning tree O Octree P PQ tree Parent node Parse tree Patricia trie Polytree Prim's algorithm

Q Quadtree R R plus tree R* tree R-tree Radix tree Red-black tree Root node S Scapegoat tree Self-balancing binary search tree Splay tree Steiner tree Suffix tree T T-tree Tech tree Tree (graph theory) Tree rotation Tree search algorithm Tree structure Trie V Van Emde Boas tree