In a recent study, the use of a binary tree data structure was proposed as a way to speed up the computation of 3D hole diamonds rings for cheap digging. The binary tree data structure is a way of representing data in a tree-like hierarchy, and has some advantages over other data structures when it comes to speed and efficiency. In the preliminary study, the authors used a binary tree to represent the data for a 3D hole digging problem, and found that it was able to speed up the computation by a factor of two