In this article, we will introduce an interesting data structure called Binary Heap. Here is the link to the article:
Enjoy 🙂 !!!
Articles | Notes | Tips | Tutorials
In this article, we will introduce an interesting data structure called Binary Heap. Here is the link to the article:
Enjoy 🙂 !!!
Ever wondered how the modern distributed data stores like CockroachDB, YugabyteDB, TiDB, Kudu, etc., kept data in-sync across the different nodes in the cluster ??? They all use one thing in common – the Raft Consensus Alogrithm to maintain consistency among the nodes in the cluster.
In this article, we unravel the inner workings of Raft by implementing our own version of the algorithm in Go programming language.
Here is the link to the article:
Raft Consensus Algorithm Unraveled
Enjoy 😉 !!!
In Part-2 of this series, we will introduce an optimized version of the Trie data structure called Compact Trie or Patricia Trie. Here is the link to the article:
Introduction to Trie Data Structure – Part 2
Enjoy 🙂 !!!
In Part-1 of this series, we will introduce an interesting data structure called Trie. Here is the link to the article:
Introduction to Trie Data Structure – Part 1
Enjoy 🙂 !!!