Misplaced Pages

The following pages link to Collection (abstract data type)

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• Array (data structure) (links | edit)
• AVL tree (links | edit)
• Abstract data type (links | edit)
• Binary search tree (links | edit)
• B-tree (links | edit)
• Collection (links | edit)
• Data structure (links | edit)
• Double-ended queue (links | edit)
• Hash table (links | edit)
• Heap (data structure) (links | edit)
• Icon (programming language) (links | edit)
• Linked list (links | edit)
• Merge algorithm (links | edit)
• Priority queue (links | edit)
• Queue (abstract data type) (links | edit)
• Red–black tree (links | edit)
• Splay tree (links | edit)
• Tree (abstract data type) (links | edit)
• Trie (links | edit)
• Binary heap (links | edit)
• Associative array (links | edit)
• Counting sort (links | edit)
• Iterator pattern (links | edit)
• Interface (object-oriented programming) (links | edit)
• Iterator (links | edit)
• List of data structures (links | edit)
• Set (abstract data type) (links | edit)
• List (abstract data type) (links | edit)
• Binomial heap (links | edit)
• Fibonacci heap (links | edit)
• Stack (abstract data type) (links | edit)
• XOR linked list (links | edit)
• Skip list (links | edit)
• Sparse matrix (links | edit)
• Self-balancing binary search tree (links | edit)
• Association list (links | edit)
• Pointer (computer programming) (links | edit)
• Union type (links | edit)
• Graph (abstract data type) (links | edit)
• Binary decision diagram (links | edit)
• Monad (functional programming) (links | edit)
• 2–3 tree (links | edit)
• Comparison of C Sharp and Java (links | edit)
• Result set (links | edit)
• R-tree (links | edit)
• Unrolled linked list (links | edit)
• Disjoint-set data structure (links | edit)
• Bit array (links | edit)
• R+ tree (links | edit)
• R*-tree (links | edit)