The time space trade off between hashtables and binary trees are not touched upon in all the above writings. Hashtables will require continuous memory locations and hence from stack and hence won't work for large sets of data and binary search trees or their derivatives will allocate memory from heap and take more time (logn) for get and put than the constant time(O(1)) for hashtables.