Tag: data-structures — Code Glossary

🤖 AI Guestbook — #data-structures educational data only

| |

Last 30 days

Agents 23

Amazonbot 6Perplexity 3

Amazonbot 5Perplexity 2

Amazonbot 247Perplexity 163Google 55Ahrefs 54Unknown AI 48Claude 33SEMrush 18ChatGPT 16Majestic 7Meta AI 2Bing 1

How they use it

crawler 600 crawler_json 33 pre-tracking 11

Tag total644 pings Terms pinged25 / 25 Distinct agents10

Sort A → Z Recently Added Recently Updated Difficulty Most Viewed Most Rated Most Shared

Level All Beginner Intermediate Advanced Tag: data-structures ✕

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Trie (Prefix Tree)

A tree where each node represents a character — paths from root to leaf spell out keys, enabling O(m) lookup, prefix search, and autocomplete where m is key length, independent of dataset size.

1mo ago data_structures intermediate

Inverted Index

A data structure that maps each unique word to the list of documents containing it — the foundation of all full-text search engines, enabling fast lookup of documents matching a query term.

2mo ago search intermediate

SPL Introduction — Standard PHP Library PHP 5.0+

SPL (Standard PHP Library, PHP 5.0) added data structures, iterators, and interfaces — SplStack, SplQueue, SplHeap, ArrayObject, and the Iterator/Countable interfaces.

2mo ago php intermediate

Adjacency Matrix vs Adjacency List

Two ways to represent a graph — adjacency matrix (2D array, O(1) edge lookup, O(V²) space) vs adjacency list (array of lists, O(V+E) space, better for sparse graphs).

2mo ago data_structures intermediate

B-Trees & B+ Trees

Self-balancing tree structures used in database indexes — each node holds multiple keys, keeping the tree shallow and minimising disk I/O for range queries.

2mo ago data_structures advanced

Circular Buffer / Ring Buffer PHP 5.0+

A fixed-size array treated as circular — the write pointer wraps around when it reaches the end, overwriting the oldest data. Used for logs, audio streaming, and producer-consumer queues.

2mo ago data_structures intermediate

Disjoint Set / Union-Find

A data structure tracking which elements belong to the same group — supporting near-O(1) union and find operations. Used for network connectivity, Kruskal's MST, and cycle detection.

2mo ago data_structures advanced

Graphs

A collection of nodes (vertices) connected by edges — directed or undirected, weighted or unweighted. The most general data structure, modelling networks, dependencies, and relationships.

2mo ago data_structures intermediate

Queues PHP 5.3+

A FIFO (First In, First Out) data structure — the first element enqueued is the first dequeued. Used for BFS traversal, job queues, rate limiting, and buffer management.

2mo ago data_structures beginner

Segment Trees

A tree data structure for O(log n) range queries and point updates — supporting sum, min, max over arbitrary array ranges.

2mo ago data_structures advanced

Skip Lists

A probabilistic data structure providing O(log n) search, insert, and delete — used internally in Redis sorted sets for ZADD/ZRANGE operations.

2mo ago data_structures advanced

Sparse Matrix Representations

COO, CSR, and DOK formats efficiently store matrices where most values are zero — avoiding storing terabytes of zeros for recommendation systems and graphs.

2mo ago data_structures advanced

Stacks PHP 5.3+

A LIFO (Last In, First Out) data structure — the last element pushed is the first popped. Used for function call stacks, undo history, expression parsing, and DFS traversal.

2mo ago data_structures beginner

Tries (Prefix Trees) PHP 5.0+

A tree where each path from root to node spells a prefix — enabling O(m) insert, lookup, and prefix search where m is the string length, regardless of dictionary size.

2mo ago data_structures advanced

Arrays PHP 5.0+

The most fundamental data structure — a contiguous block of memory holding elements of the same type, offering O(1) index access but O(n) insertion and deletion in the middle.

2mo ago data_structures beginner

Binary Trees PHP 5.0+

A hierarchical structure where each node has at most two children — Binary Search Trees enable O(log n) search, while balanced variants (AVL, Red-Black) guarantee it.

2mo ago data_structures intermediate

Bloom Filter PHP 7.0+

A probabilistic data structure that tests set membership in O(1) time and O(1) space, with a tunable false-positive rate and zero false negatives.

2mo ago data_structures advanced

Graph Algorithms PHP 5.0+

Algorithms for traversing, searching, and finding paths in graphs — BFS for shortest hops, DFS for exploration, Dijkstra for weighted shortest paths.

2mo ago algorithms advanced

Hash Table PHP 5.0+

A data structure that maps keys to values using a hash function, providing amortised O(1) average-case lookups, insertions, and deletions.

2mo ago data_structures intermediate

Heaps & Priority Queues PHP 5.3+

A tree-based structure satisfying the heap property — min-heap: parent ≤ children; max-heap: parent ≥ children — enabling O(1) peek and O(log n) insert/extract for priority queues.

2mo ago data_structures intermediate

1 2 Next →