First I'd like to ask how one goes about understanding errors that java throws at you. Has anyone written about this or is it somehting that comes with time?<BR><BR>Second, here is my most recent ...

When comparing binary search tree (BST) implementations in Java, each has trade-offs. Standard BSTs are simple and memory-efficient but slow to O(n) if unbalanced.