Category:Trees (structure)

From TheBestLinks.com

es:Category:Árboles (estructura) In graph theory, a tree is a graph in which any two vertices are connected by exactly one path. 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 a disjoint union of trees (hence the name). Trees are useful abstract structural representations of many different concepts.

Articles in category "Trees (structure)"

There are 46 articles in this category.

A A-star search algorithm AVL tree Abstract syntax tree B B*-tree B-tree Best-first search Binary heap Binary search tree Binary space partitioning Binary tree Binomial heap Boruvka's algorithm Breadth-first search C Child node D Decision tree

D Depth-first search E Exponential tree F Fibonacci heap G Game tree H Heap I Iterative deepening depth-first search K 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 Prim's algorithm

Q Quadtree R R-tree Red-black tree Root node S Self-balancing binary search tree Splay tree Steiner tree Suffix tree T Tech tree Tree (graph theory) Tree data structure Tree rotation Tree search algorithm Tree structure Trie

Related links

---

Top visited 0 of 0 links

[no links posted yet]

>> place link >>

Discussion

Last posted 0 of 0 messages

[no messages posted yet]

>> post message >>

Watch

You can add this article to your own "watchlist" and receive e-mail notification about all changes in this page.