Data Structures reference data

Datasets in Data Structures

• Advanced Graph Algorithms

  Advanced graph algorithms: strongly connected components (Tarjan's, Kosaraju's), max flow (Ford-Fulkerson, Edmonds-Karp, Dinic), matching, and graph coloring.

• Concurrent Data Structures

  Thread-safe data structures: concurrent hash maps, skip lists, queues, stacks, read-write locks, lock-free algorithms, and compare-and-swap patterns.

• Data Structure Complexity Analysis

  Time and space complexity analysis of common data structures: Array, Linked List, Binary Search Tree, Hash Table, Heap, and Graph with Big-O notation.

• Graph Algorithms

  Essential graph algorithms: traversals (BFS, DFS), shortest path (Dijkstra, Bellman-Ford), minimum spanning tree (Prim, Kruskal), topological sort, and network flow.

• Hash Tables & Hash Functions

  Hash table implementations, collision resolution strategies, hash functions, load factor, and performance characteristics.

• Probabilistic Data Structures: Bloom Filters & Beyond

  Probabilistic data structures for approximate set membership, counting, and cardinality estimation: Bloom filters, Count-Min Sketch, HyperLogLog, and Cuckoo filters.

• Sorting Algorithms Comparison

  Time and space complexity comparison of sorting algorithms: Bubble, Selection, Insertion, Merge, Quick, Heap, Counting, and Radix Sort with stability notes.

• Spatial Data Structures

  Spatial indexing structures for multi-dimensional data: k-d trees, R-trees, quadtrees, octrees, grid files, and space-filling curves (Z-order, Hilbert).

• String Algorithms and Pattern Matching

  String processing algorithms: KMP, Rabin-Karp, Z-algorithm, suffix trees/arrays, Aho-Corasick, and edit distance (Levenshtein).

• Tree Data Structures

  Complete reference of tree data structures: binary trees, BST, AVL, Red-Black, B-trees, B+ trees, segment trees, and trie.

GET https://yjtoon.com/api/category/data-structures?format=json