A binary tree is a data structure in which each element, except for the root, is positioned in relation to the previous element. And since it is binary there can be only two positions for each element. A hash table is a data structure that maps its elements based on some type of key that represents that element.