User:Wanzhang/Books/Data Structure
 | 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 ] | ||||||||
Data Structure
[edit]- Contents
- Data structure
- List of data structures
- Arrays
- Array data structure
- Dynamic array
- Bit array
- Hash table
- Circular buffer
- Hashed array tree
- Sparse array
- Linked
- Linked data structure
- Association list
- Linked list
- Doubly linked list
- Unrolled linked list
- Skip list
- XOR linked list
- Trees
- Tree (data structure)
- Binary Trees
- Binary tree
- Binary search tree
- Cartesian tree
- MVP tree
- Top tree
- T-tree
- Left-child right-sibling binary tree
- Self-balancing binary search trees
- Self-balancing binary search tree
- AA tree
- AVL 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