Treap: Randomized Binary Search Tree
The treap is a randomized binary search tree that achieves balance through probability rather than rigid structural rules. The name combines ’tree’ and ‘heap’—an apt description since treaps…
Read more →Binary
Threaded Binary Tree: In-Order Traversal Without Stack
Every time you write a recursive in-order traversal, you’re paying a hidden cost. That elegant three-line function consumes O(h) stack space, where h is the tree height. For a balanced tree with a…
Read more →Semaphore: Counting and Binary Semaphores
Edsger Dijkstra introduced semaphores in 1965 as one of the first synchronization primitives for concurrent programming. The concept is elegantly simple: a semaphore is an integer counter that…
Read more →Python - Read/Write Binary Files
Binary files contain raw bytes without text encoding interpretation. Unlike text files, binary mode preserves exact byte sequences, making it critical for non-text data.
Read more →Priority Queue: Binary Heap Implementation
A priority queue is an abstract data type where each element has an associated priority, and elements are served based on priority rather than insertion order. Unlike a standard queue’s FIFO…
Read more →NumPy - np.searchsorted() - Binary Search
• np.searchsorted() performs binary search on sorted arrays in O(log n) time, returning insertion indices that maintain sorted order—dramatically faster than linear search for large datasets
Heap Sort: Using Binary Heap for Sorting
Heap sort is a comparison-based sorting algorithm that leverages the binary heap data structure to efficiently organize elements. Unlike quicksort, which can degrade to O(n²) on adversarial inputs,…
Read more →Go Byte Slices: Binary Data Handling
The []byte type is Go’s primary mechanism for handling binary data. Unlike strings, which are immutable sequences of UTF-8 characters, byte slices are mutable arrays of raw bytes that give you…
Fenwick Tree: Binary Indexed Tree Implementation
Consider a common scenario: you have an array of numbers and need to repeatedly compute prefix sums while also updating individual elements. This appears in countless applications—tracking cumulative…
Read more →D-ary Heap: Generalized Binary Heap
A d-ary heap is exactly what it sounds like: a heap where each node has up to d children instead of the binary heap’s fixed two. When d=2, you get a standard binary heap. When d=3, you have a ternary…
Read more →Binary Protocols: Custom Wire Formats
Text protocols like JSON and XML won the web because they’re human-readable, self-describing, and trivial to debug with curl. But that convenience has a cost. Every JSON message carries redundant…
Read more →Binary Search Tree: Implementation and Operations
A binary search tree is a hierarchical data structure where each node contains a value and references to at most two children. The defining property is simple but powerful: for any node, all values…
Read more →Binary Search: Divide and Conquer Search
Binary search is the canonical divide and conquer algorithm. Given a sorted collection, it finds a target value by repeatedly dividing the search space in half. Each comparison eliminates 50% of…
Read more →Binary Heap: Min-Heap and Max-Heap Implementation
A binary heap is a complete binary tree that satisfies the heap property. ‘Complete’ means every level is fully filled except possibly the last, which fills left to right. The heap property defines…
Read more →