Data Structures

In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. 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. (Source: Wikipedia)

• YouTube

B - Beginner, A - Advanced

* Algorithms without the Code link are not implemented yet.

• B Doubly linked list [Code]
• B Hash table [Code]
• B Heap [Code]
  • B Min heap [Code]
  • B Max heap [Code]
  • A Fibonacci heap
• B Linked list [Code]
• B Priority queue [Code]
• B Queue [Code]
• B Stack [Code]
• A Trees
  • A AVL tree [Code]
  • A Binary search tree [Code]
  • A Fenwick tree [Code]
  • A Red-Black tree [Code]
  • A Segment tree [Code]
  • A B-tree
  • A Splay tree
• A Trie [Code]
• A Graph [Code]
• A Disjoint Set [Code]
• A Bloom Filter [Code]