User:Midhunsree/Books/Data Structures
 | 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 Structures[edit]
& Related Algorithms[edit]
- Data Structures
- Data structure
- Abstract data type
- Array data structure
- Stack (abstract data type)
- Queue (abstract data type)
- Circular buffer
- Double-ended queue
- Linked list
- Skip list
- Hash table
- Tree (data structure)
- Binary tree
- Binary search tree
- Heap (data structure)
- Binary heap
- Priority queue
- Binomial heap
- Fibonacci heap
- B-tree
- B+ tree
- 2–3 tree
- 2–3–4 tree
- Self-balancing binary search tree
- AVL tree
- Red–black tree
- Splay tree
- Radix tree
- Trie
- Random binary tree
- Treap
- Algorithms
- Tree traversal
- Day–Stout–Warren algorithm
- Tree rotation
- Graph traversal
- Breadth-first search
- Depth-first search
- Iterative deepening depth-first search
- Dijkstra's algorithm
- Prim's algorithm
- Bellman–Ford algorithm
- Floyd–Warshall algorithm
- Graph coloring
- Topological sorting