User:Vbzerocool/Books/trees1
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Trees[edit]
- Binary search tree
- Binary search tree
- Cartesian tree
- MVP Tree
- Top tree
- T-tree
- Left-child right-sibling binary tree
- Binary tree
- Self-balancing binary search trees
- Self-balancing binary search tree
- AA tree
- AVL tree
- Left-leaning red–black tree
- Red–black tree
- Scapegoat tree
- Splay tree
- Treap
- B-trees
- B-tree
- B+ tree
- Bx-tree
- UB-tree
- 2–3 tree
- 2–3–4 tree
- (a,b)-tree
- Dancing tree
- Htree
- Tries
- Trie
- Suffix tree
- Radix tree
- Hash tree (persistent data structure)
- Ternary search tree
- X-fast trie
- Y-fast trie
- Binary space partitioning (BSP) trees
- Binary space partitioning
- Quadtree
- Octree
- K-d tree
- Implicit k-d tree
- Vantage-point tree
- Non-binary trees
- Exponential tree
- Fusion tree
- PQ tree
- Range tree
- SPQR tree
- Van Emde Boas tree
- Spatial database
- Spatial data partitioning trees
- R-tree
- R+ tree
- R* tree
- X-tree
- M-tree
- Segment tree
- Hilbert R-tree
- Priority R-tree
- Other trees
- Heap (data structure)
- Hash calendar
- Merkle tree
- Finger tree
- Order statistic tree
- Metric tree
- Cover tree
- BK-tree
- Doubly chained tree
- IDistance
- Link/cut tree
- Fenwick tree
- Log-structured merge-tree
- Interval tree