FIT VUT – IAL – 2nd homework 10/10 points Implementation of a hashtable and iterative & recursive versions of a binary tree.