Implemented binaryTree

Has clunky/strange [0] notation due to issues with Python's value
passing.

Implements:
-> generic comparator
-> tree printing
-> insertion, given a node
-> inorder walk/traversal
-> flattening of nested lists
-> searching, given data
-> finding successor, given a node
-> removing a node, given data

Runs:
1) Input "minVal" and "maxVal"
2) A binary tree will be built based on a randomized array in the range
[minVal, maxVal)
3) Every element is inserted into the tree
4) Print every element's successor
5) Delete elements in ascending order and print tree as per deletion
for checking