This project contains different implementations of hash maps
Currently developed:

1. Using a Binary Search Tree as underlying data structure
2. Using a Dynamic resizing array as underlying data structure

This project depends on:

1. googletest
2. valgrind

1. $./configure.sh This step will simply init the git submodule for googletest
2. $make

To Run all unit tests, use:
$make test

To Run all tests using valgrind, use:
$make test-valgrind

CREATE key value;

Creates new element 'key' with value 'value'

READ key;

Returns value of element 'key'

UPDATE key new-value;

Updates value of element 'key' to 'new-value'

DELETE key;

Deletes element 'key'