Defines solution to the Convex Hull problem proposed by Andrew which uses balanced binary trees to store the partial hulls, rather than linked lists.