2–3 heap

A 2–3 heap is an advanced type of data structure that can be used to store a growing list of items. It works by storing the data in "branches" like a tree. Every item in the list has two possible "branches" beneath it. When the list grows, it can either add items to the left branch, or to the right branch. The branches can then be combined together and the item in the middle will be the "root" of the tree. This makes it easier to find, remove, and add items from the list quickly.