Data Structures Documentation

1. Arrays

Documentation: Arrays - Python | Arrays - Java

2. Linked Lists

Documentation: Linked List - Python | Linked List - Java

3. Stacks

Documentation: Stack - Python | Stack - Java

4. Queues

Documentation: Queue - Python | Queue - Java

5. Trees

Documentation: Binary Tree - Python | Tree - Java

6. Graphs

Documentation: Graph - Python | Graph - Java

7. Hash Tables

Documentation: Dict (Hash Table) - Python | HashMap - Java

8. Heaps

Documentation: Heap Queue Algorithm - Python | PriorityQueue - Java

9. Hash Sets

Documentation: HashSet - Java

10. Hash Maps

Documentation: HashMap - Java

11. Graph Algorithms

Documentation: Graph Algorithms - Wikipedia

12. Trie

Documentation: Trie - Wikipedia

13. Disjoint Set (Union-Find)

Documentation: Disjoint Set (Union-Find) - Wikipedia

14. AVL Trees

Documentation: AVL Trees - Wikipedia

15. Red-Black Trees

Documentation: Red-Black Trees - Wikipedia

16. Bloom Filter

Documentation: Bloom Filter - Wikipedia

17. Splay Trees

Documentation: Splay Trees - Wikipedia

18. Skip Lists

Documentation: Skip Lists - Wikipedia

19. Radix Trees

Documentation: Radix Trees - Wikipedia

20. B-Trees

Documentation: B-Trees - Wikipedia

21. Fenwick Tree (Binary Indexed Tree)

Documentation: Fenwick Tree (Binary Indexed Tree) - Wikipedia

22. Quad Trees

Documentation: Quad Trees - Wikipedia

23. Suffix Trees

Documentation: Suffix Trees - Wikipedia

24. XOR Linked Lists

Documentation: XOR Linked Lists - Wikipedia

25. Cartesian Trees

Documentation: Cartesian Trees - Wikipedia

26. Patricia Tries

Documentation: Patricia Tries - Wikipedia

27. Rope Data Structure

Documentation: Rope Data Structure - Wikipedia

28. Merkle Trees

Documentation: Merkle Trees - Wikipedia

29. Treaps

Documentation: Treaps - Wikipedia

30. Bloomier Filters

Documentation: Bloomier Filters - Wikipedia

31. Cuckoo Hashing

Documentation: Cuckoo Hashing - Wikipedia

32. Dancing Links (DLX)

Documentation: Dancing Links (DLX) - Wikipedia

33. Burstsort

Documentation: Burstsort - Wikipedia

34. Van Emde Boas Trees

Documentation: Van Emde Boas Trees - Wikipedia

35. XOR Queues

Documentation: XOR Queues - Wikipedia

36. Bloom Tree Filters

Documentation: Bloom Tree Filters - Wikipedia

37. Judy Arrays

Documentation: Judy Arrays - Wikipedia

38. Count-Min Sketch

Documentation: Count-Min Sketch - Wikipedia

39. XOR-Linked Trees

Documentation: XOR-Linked Trees - Wikipedia

40. Min-Max Heap

Documentation: Min-Max Heap - Wikipedia

41. Ternary Search Trees

Documentation: Ternary Search Trees - Wikipedia

42. Rope (Concatenated String)

Documentation: Rope (Concatenated String) - Wikipedia

43. Burst Tries

Documentation: Burst Tries - Wikipedia

44. Fibonacci Heap

Documentation: Fibonacci Heap - Wikipedia

45. B*-Trees

Documentation: B*-Trees - Wikipedia

46. Rank-Balanced Trees

Documentation: Rank-Balanced Trees - Wikipedia

47. K-D Trees

Documentation: K-D Trees - Wikipedia

48. Judy Multiarrays

Documentation: Judy Multiarrays - Wikipedia

49. Finger Trees

Documentation: Finger Trees - Wikipedia

50. Link/Cut Trees

Documentation: Link/Cut Trees - Wikipedia

51. Ctrie

Documentation: Ctrie - Wikipedia

52. Rope (Data Structure)

Documentation: Rope (Data Structure) - Wikipedia

53. Judy Hash Array

Documentation: Judy Hash Array - Wikipedia

54. Censor Trees

Documentation: Censor Trees - Wikipedia

55. Range Trees

Documentation: Range Trees - Wikipedia

56. Tangle Trees

Documentation: Tangle Trees - Wikipedia

57. Fusion Trees

Documentation: Fusion Trees - Wikipedia

58. Patricia Trie (Practical Implementation)

Documentation: Patricia Trie (Practical Implementation) - Wikipedia

59. Concurrent Tries

Documentation: Concurrent Tries - Wikipedia

60. Unrolled Linked Lists

Documentation: Unrolled Linked Lists - Wikipedia

61. BK-Tree (Burkhard-Keller Tree)

Documentation: BK-Tree (Burkhard-Keller Tree) - Wikipedia

62. X-fast Tries

Documentation: X-fast Tries - Wikipedia

63. Y-fast Tries

Documentation: Y-fast Tries - Wikipedia

64. Fusion Hashing

Documentation: Fusion Hashing - Wikipedia

65. Fat Trees

Documentation: Fat Trees - Wikipedia

66. X-trees

Documentation: X-trees - Wikipedia

67. External Memory Data Structures

Documentation: External Memory Data Structures - Wikipedia

68. Binary Decision Diagrams (BDD)

Documentation: Binary Decision Diagrams (BDD) - Wikipedia

69. Succinct Data Structures

Documentation: Succinct Data Structures - Wikipedia

70. XOR-Linked Deques

Documentation: XOR-Linked Deques - Wikipedia

71. Ctrie (Concurrent Trie)

Documentation: Ctrie (Concurrent Trie) - Wikipedia

72. Double-Ended Priority Queue

Documentation: Double-Ended Priority Queue - Wikipedia

73. Threaded Binary Trees

Documentation: Threaded Binary Trees - Wikipedia

74. Fusion Hash Trie

Documentation: Fusion Hash Trie - Wikipedia

75. Extendible Hashing

Documentation: Extendible Hashing - Wikipedia

76. Ropes (Generalized Data Structure)

Documentation: Ropes (Generalized Data Structure) - Wikipedia

77. Pairing Heaps

Documentation: Pairing Heaps - Wikipedia

78. B-ary Trees

Documentation: B-ary Trees - Wikipedia

79. Shellsort Trees

Documentation: Shellsort Trees - Wikipedia

80. Bonsai Trees

Documentation: Bonsai Trees - Wikipedia

81. Rope (Concatenated String, Efficient)

Documentation: Rope (Concatenated String, Efficient) - Wikipedia

82. HAT-Trie

Documentation: HAT-Trie - Wikipedia

83. Dancing Trees

Documentation: Dancing Trees - Wikipedia

84. Spiral Trees

Documentation: Spiral Trees - Wikipedia

85. Symmetric Trees

Documentation: Symmetric Trees - Wikipedia

86. Exponential Trees

Documentation: Exponential Trees - Wikipedia

87. Fusion Hash Array

Documentation: Fusion Hash Array - Wikipedia

88. Lossy Counting

Documentation: Lossy Counting - Wikipedia

89. Skiplist Set

Documentation: Skiplist Set - Wikipedia

90. Y-fast Tries

Documentation: Y-fast Tries - Wikipedia

91. Optimized Hashtable

Documentation: Optimized Hashtable - Wikipedia

92. Recursive Dynamic Array

Documentation: Recursive Dynamic Array - Wikipedia

93. Cartesian AVL Tree

Documentation: Cartesian AVL Tree - Wikipedia

94. Skewed Trees

Documentation: Skewed Trees - Wikipedia

95. Multi-dimensional Trees

Documentation: Multi-dimensional Trees - Wikipedia

96. Implicit Treap

Documentation: Implicit Treap - Wikipedia

97. Quad Heaps

Documentation: Quad Heaps - Wikipedia

98. Hybrid Binary Heaps

Documentation: Hybrid Binary Heaps - Wikipedia

99. Leaf Trees

Documentation: Leaf Trees - Wikipedia

100. Xor-Pairing Heap

Documentation: Xor-Pairing Heap - Wikipedia

101. Ternary Trees

Documentation: Ternary Trees - Wikipedia

102. Fibonacci Queue

Documentation: Fibonacci Queue - Wikipedia

103. Ball Trees

Documentation: Ball Trees - Wikipedia

104. Disjoint Heap

Documentation: Disjoint Heap - Wikipedia

105. Ternary Heap

Documentation: Ternary Heap - Wikipedia