def find(self, *args):
curr_node = self.__root<EOL>return self.__traverse(curr_node, <NUM_LIT:0>,  *args)<EOL>
Find a node in the tree. If the node is not found it is added first and then returned.

:param args: a tuple
:return: returns the node