Prefix Sum & Kadane's Sliding Window Two Pointers

Singly Linked List Doubly Linked List

Stack Operations Queue Operations

Monotonic Stacksoon

Binary Search Tree AVL Tree Tree Traversals Heap / Priority Queue

Collision Handlingsoon

BFS & DFSsoon

Dijkstra's Algorithmsoon

Goroutines

Overview Advanced Runtime & Leak Management

Channels Memory Model GC

MVCC & Transactions

Indexing

Overview B-Tree Index GIN Index Hash Index

Isolation Levels

Query Plannersoon

WAL & Recoverysoon

Vacuum & Bloatsoon

Data Structuressoon

Persistencesoon

Pub/Sub & Streamssoon

Cluster & Replicationsoon

Architecturesoon

Subscriptionssoon

Tiered Storagesoon

Partitions & Offsetssoon

Consumer Groupssoon

Replicationsoon

CAP Theoremsoon

Raft Consensussoon

Cache Patternssoon

Eviction Policiessoon

PostgreSQL

B-Tree internals shown as a table-first walkthrough: the `users` heap stays dominant while the tree pages explain how keys resolve to TIDs.

PostgreSQL: B-Tree Deep Dive

Choose Search, Insert, or Delete to step through the B-Tree and watch the heap TIDs and leaf pages change one click at a time.

→ root -> leaf page -> key -> TID