Basic Implementation of B+ Tree of general order in python3, which can be run using the following command:

python3 part1.py <filepath>

Each line of file should contain a query. The following types of queries are supported:

1. INSERT x - Inserts x into the B+ tree
2. FIND x - Prints YES if x is already inserted, else NO
3. COUNT x - Prints number of occurrences of x in B+ tree
4. RANGE x y - Prints number of elements in range x to y (both x and y included)

Here, -10⁹ <= x, y <= 10⁹.

Implementation of linear hashing algorithm described here in python3, explained in class, to handle duplicate elimination.

python3 part2.py <filepath>

Each line of input file should contain an integer x, x is printed if it was not inserted before in the hashtable. Here, -10⁹ <= x <= 10⁹.