Tree-Based-ADTs Implementations of simple tree based data structures: standard Binary Search Tree, self-balancing trees such as AVL and Red-Black Trees for efficient look-up, and an implementation of a simple Prefix Tree.