Data Structures

A data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.

B - Beginner, A - Advanced

• BLinked List
• BDoubly Linked List
• BQueue
• BStack
• BHash Table
• BHeap - max and min heap versions
• BPriority Queue
• ATrie
• ATree
  • ABinary Search Tree
  • AAVL Tree
  • ARed-Black Tree
  • ASegment Tree - with min/max/sum range queries examples
  • AFenwick Tree (Binary Indexed Tree)
• AGraph (both directed and undirected)
• ADisjoint Set
• ABloom Filter