This post is an oversimplified explanation on how memory management works; and why buying more memory won’t help you to solve out of memory exceptions.
Queues are a special kind of linked lists that allows you to handle a variable-sized collection of elements in first in first out fashion (FIFO). As well as all of the data structures we have seen so far; queues are just sequences of connected nodes.
Today I’ll share some thoughts about recurring questions I got at Codementor, such as:
A set is an unordered sequence of unique elements (called members) grouped because they…
Binary search trees, or BTSs for short, are data structures designed to perform…
Writing this series has been a lot of fun, and based on feedback, I decided to write this post to provide an index (so posts can be bookmarked), and to tell you what this series was all about and what you can learn from it. So, with no further ado, let’s…