Binary space partitioning recursively subdivides a space. It is an application of binary trees and often used for procedurally generated game levels or computational art.
Binary Search Trees are are a data structure allowing O(log(N)) lookup of entries. We implement insertion, traversal, and search methods for Binary Search Trees.
The Singly Linked List is a classic data structure. We implement length, insert, remove, and search methods, and compare the Linked List's big-O complexity to arrays.