Data structures - gusenov/kb GitHub Wiki
- Simplilearn / Data Structure Tutorial
- Quora / Which is the most amazing data structure?
- Bloom Filter. A Data Structure for Computer Networking, Big Data, Cloud Computing, Internet of Things, Bioinformatics and Beyond by Ripon Patgiri, Sabuzima Nayak, Naresh Babu Muppalaneni - 228 pages
- Category:Structure
- Template:Data structures
- Category:Data structures
- Concurrent data structure
- Category:Distributed data structures
- Template:CS trees
- Category:Trees (data structures)
- Category:String data structures
- Template:Strings
- Opaque data type
- Dynamization
- Bloom filter is a space-efficient probabilistic data structure, that is used to test whether an element is a member of a set.
- Octree is a tree data structure in which each internal node has exactly eight children.
- Associative containers refer to a group of class templates in the standard library of the C++ programming language that implement ordered associative arrays.
- Associative array (symbol table) is an abstract data type that stores a collection of (key, value) pairs, such that each possible key appears at most once in the collection.
- The Infinite Loop
- Advanced Octrees
-
preliminaries, insertion strategies and maximum tree depth
- An Octree is a recursive, axis-aligned, spatial partitioning data structure commonly used in computer graphics to optimize collision detection, nearest neighbor search, frustum culling and more.
- node representations
- non-static Octrees
- finding neighbor nodes
-
preliminaries, insertion strategies and maximum tree depth
- Advanced Octrees