Data Struct

It is important to know how blockchain Hashing works. In order to do that, however, we need to first understand one of the core principles that go into  blockchain  creation. Blockchain technology is one of the most innovative and era-defining discoveries of the past century. Seeing the influence it has had over the last few years and the impact that it will have in the future, it surely isn’t an exaggeration to say that. In order to understand how various  cryptocurrencies  like  Ethereum  and  Bitcoin  function.   So what is hashing? In simple terms, hashing means taking an input string of any length and giving out an  output of a fixed length . In the context of cryptocurrencies like Bitcoin, the transactions are taken as input and run through a hashing algorithm ( Bitcoin uses SHA-256 ) which gives an output of a fixed length. Let’s see how the hashing process works. We are going put in certain inputs. For this exercise, we a...

Example of linked list Linked list  is a data structure that consists of a sequence of data records such that each record there is a field that contains a reference to the next record in  the sequence. Linked list allows insertion  and deletion  of any element at any location. Linked list contsist of 2 type a single linked list and double linked list. If you need to allocate memory dynamically (in runtime), you can use malloc in C/C++.  This is the example of a single linked list:  insert. And this is the example of a single linked list : Delete