Definition
In computer programming, a collection is an abstract data type that is a grouping of items that can be used in a polymorphic way.
Related concepts
.NETAA treeAVL treeAbstract data typeArray (data structure)Association listAssociative arrayB-treeBinary decision diagramBinary heapBinary search treeBinomial heapBit arrayC++ Standard LibraryCircular bufferComposite data typeComputer programmingContainer (abstract data type)Container (type theory)Data structureData typeDeterministic acyclic finite state automatonDirected acyclic graphDisjoint-set data structureDouble-ended priority queueDouble-ended queueDynamic arrayFibonacci heapGraph (abstract data type)Hash tableHash tree (persistent data structure)Hashed array treeHeap (data structure)Hilbert R-treeIndicator functionInteger (computer science)Java collections frameworkLinear data structureLinked data structureLinked listList (abstract data type)List of data structuresMultimapMultiset (abstract data type)Object (computer science)PL/SQLPolymorphism (computer science)Primitive data typePriority queueProgramming languageQueue (abstract data type)R* treeR+ treeR-treeRed–black treeRetrieval Data StructureRope (data structure)Rust (programming language)Self-balancing binary search treeSet (abstract data type)Set (computer science)Skip listSparse matrixSplay treeStack (abstract data type)Standard Template LibraryStandard librarySteven FeuersteinString (computer science)Tree (data structure)TrieType theoryUnrolled linked listVariant type (COM)XOR linked list
5 concepts already in your glossary