https://r0tbyt3.dev/tags/data-structures/Recent content in Data-Structures on Jesus OsegueraHugoen-ushttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/arrays/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/arrays/Arrays Arrays - ordered, index-based collections stored contiguously in memory with O(1) random access and O(n) insertion. Related Links: Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/binary-search-trees/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/binary-search-trees/Binary Search Trees Binary Search Trees - sorted binary trees supporting O(log n) average search, insert, and delete. Related Links: Arrays Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/Data Structures Data Structures - fundamental data structures every engineer must know, with Python 3 implementations and complexity analysis. Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees Tries Related Links: Algorithms Patternshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/graphs/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/graphs/Graphs Graphs - collections of nodes connected by edges, represented as adjacency lists or matrices in Python. Related Links: Arrays Binary Search Trees Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/hash-tables/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/hash-tables/Hash Tables Hash Tables - key-value store with O(1) average lookup, insert, and delete, implemented with Python dict and set. Related Links: Arrays Binary Search Trees Graphs Heaps Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/heaps/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/heaps/Heaps Heaps - complete binary trees satisfying the heap property, implemented with Python’s heapq module for priority queues. Related Links: Arrays Binary Search Trees Graphs Hash Tables Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/linked-lists/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/linked-lists/Linked Lists Linked Lists - node-based dynamic data structure with O(1) insertion at known positions and O(n) access by index. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/queues/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/queues/Queues Queues - FIFO data structure supporting enqueue and dequeue in O(1), implemented with collections.deque. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/sets/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/sets/Sets Sets - unordered collections of unique elements with O(1) average membership testing using Python’s built-in set. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/stacks/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/stacks/Stacks Stacks - LIFO data structure supporting push and pop in O(1), implemented with Python lists or collections.deque. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/strings/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/strings/Strings Strings - immutable sequences of characters in Python with common manipulation, searching, and pattern-matching techniques. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/trees/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/trees/Trees Trees - hierarchical node-based structures with a root and parent-child relationships used for ordered data. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/tries/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/tries/Tries Tries - prefix trees enabling O(m) string search and autocomplete, where m is the length of the key. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees