This is a comprehensive Java implementation of my algorithm for rolling binary trees, which takes a binary tree as input and rolls it in linear time, as described in this paper. Common design patterns ...

In a data set with many categorical variables and several continuous valuables, the relationship between continuous random variables may differ from category to category for a given categorical ...

This Library contains different implementations of the tree data structures, such as K-ary, binary, expression trees etc. A tree data structure can be defined recursively (locally) as a collection of ...

Good candidates can arrive at the binary search tree as the right path in a few minutes, and then take 10-15 minutes working through the rest of the problem and the other roadblocks I toss out.