implemented binary search tree with tests and main demonstraing best and...

... worst case runs
This method could be made much simpler if you make the while loop contingent on "node.value != val" and reconsider where you place "current_node == current _node.right/left" =)