This project implements Radix Trees and performs complete analysis for insert
and search
in comparison to Tries and Ternary Search Trees. It was taken up as a project for the course IT204 (Data Structures and Algorithms Lab).
insert
function for the 3 data structures
search
function for the 3 data structures