Solidity Trees: Binary Search Trees (Part 1)
This is the first part in a two part series about tree implementations in solidity. In this first part, we will be going over the basics of trees and implementing one of the most basic of trees, the binary search tree. We will first talk about what trees are and why we use them, some basic overview on time complexity, and then we will go analyze an implementation in solidity.What are trees?A tree is an abstract data structure where data is stored in a hierarchical tree structure in the form o...
Solidity Trees: Binary Search Trees (Part 1)
This is the first part in a two part series about tree implementations in solidity. In this first part, we will be going over the basics of trees and implementing one of the most basic of trees, the binary search tree. We will first talk about what trees are and why we use them, some basic overview on time complexity, and then we will go analyze an implementation in solidity.What are trees?A tree is an abstract data structure where data is stored in a hierarchical tree structure in the form o...
Creating a stack in solidity via a linked list.
Ok, cool. Now what are all these words. A stack? A linked list? Solidity? Lets start off with going over linked lists.If you are already familiar with linked lists and stacks, you can skip these parts and go to the end where the solidity code is discussedWhat is a linked list?A linked list is a data structure that is made up of nodes. Every node contains two things: data, and a pointer to the next node in the list. In this scenario, we are using a single linked list, which is a linked list th...
Creating a stack in solidity via a linked list.
Ok, cool. Now what are all these words. A stack? A linked list? Solidity? Lets start off with going over linked lists.If you are already familiar with linked lists and stacks, you can skip these parts and go to the end where the solidity code is discussedWhat is a linked list?A linked list is a data structure that is made up of nodes. Every node contains two things: data, and a pointer to the next node in the list. In this scenario, we are using a single linked list, which is a linked list th...
