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...