Merkle Trees - II
Gaining trust faster? lighter?
Programming Bytes with Satyarth
Software Engineer. Curious to learn and grow everyday. Breaking things to figure out how to fix them better.
Latest articles
Golang Structs Memory Allocation - II
The benchmark numbers
Golang Structs Memory Allocation
Optimizing the memory
Introduction to Go Generics
Generics arrive!!!
Merkle Trees
Champs of Data Integrity
Data Structures Series V - Binary Trees
Trees are non linear data structures in the world of computer science where each element is called a node and each node may or may not have children associated with them. Binary Trees are a special type of trees where each node can have up to two chi...
Data Structures Series IV - Heaps
Heaps are one of the most famous example of non-linear data structures because of the various use-cases where heaps give advantage over other data structures in terms of time and space complexity. We will be using the example of max-heap where the m...
Data Structures Series III - Linked Lists
Linked Lists as data structures are very powerful and provide a lot of flexibility and enhanced performance especially in systems with memory constraints towards continuous memory allocation because linked lists do not need a large continuous block o...
Data Structure Series - Queues
First In, First Out