def align_add(tree, key, item, align_thres=<NUM_LIT>):
for near_key, near_list in get_near_items(tree, key):<EOL><INDENT>if abs(key - near_key) < align_thres:<EOL><INDENT>near_list.append(item)<EOL>return<EOL><DEDENT><DEDENT>tree[key] = [item]<EOL>
Adding the item object to a binary tree with the given
key while allow for small key differences
close_enough_func that checks if two keys are
within threshold