Advanced data structures are
data structures that are designed to solve specific problems
Advanced data structures often require a
understanding of computer science and algorithms
of advanced data structures include hash tables, heaps, tries, suffix trees, and bloom filters.
Hash tables are a data structure that stores data in an array-like format, but uses a
function to map keys to indices
Heaps are a
data structure in which each node is greater than or equal to the values of its children or less than or equal to the values of its children.
Tries are a tree-based data structure that is used for efficient
matching and prefix search
Bloom filters are a
data structure that is used to test whether an element is a member of a set,
Advanced data structures can be
using arrays, linked lists, or dynamically-allocated memory
Non linear data structure