fix a program for image hash code by using NB+ Tree the search a similar image

the required functionality is retrieval of all similar images to a cue image, where the degree of similarity is user-set via a tolerance input (in [0,100], with 0=identical and 100=all stored images). This requires the use of a special data structure called NB+Tree. To use an NB+Tree, the bit string will have to be mapped to a key by simply counting the number of 1s in the bit string. Similar bit strings (e.g., 10111000 and 10101000) will have similar keys (e.g., 4 and 5, respectively), but on the downside, some dissimilar bit strings will also have similar - even identical - keys (e.g., 1010101010 and 0101010101 both have key 5). As such, retrieved keys will have to be filtered first by using a bitwise XOR comparison of the cue and retrieved key, to ensure the percentage difference is within tolerance.