I wanted to do a brief overview on SQL since I have not utilized it in a while.
A Binary Search tree is a tree data structure. There is a root node. The node can have at most two children. Each left child has a value that is less than the parent’s value and each right child has a value greater to the parent’s value. I will be going over a few methods such as
A linked list is a linked list of nodes. The head is the first node in the list and the tail is the last one. The data contained in the node can be a string, a number, an array or an object. In a singly-linked list, the nodes each have one pointer to the next node.
Caching is the process of storing data so that future requests for that data can be served faster. This can improve the speed of your website and improve the user experience. There are various types of caching in Ruby on Rails such as: