parameters: (self, key)
return_statement: return node.value
docstring: returns value of the key if the key is present, else -1
docstring_summary: returns value of the key if the key is present, else -1
docstring_tokens: returns value of the key if the key is present else - 1
function: def get(self, key):
          """ returns value of the key if the key is present, else -1 """
          def _get(node, key, depth):
              """ recursive internal method which works on node level """
              if node is None:
                  return None
  
              char = key[depth]
  
              if char < node.character:
                  return _get(node.left, key, depth)
              if char > node.character:
                  return _get(node.right, key, depth)
              if depth < len(key) - 1:
                  return _get(node.middle, key, depth + 1)
              return node
  
          node = _get(self.root, key, 0)
  
          if node is None:
              return -1
          return node.value
function_tokens: def get ( self , key ) : def _get ( node , key , depth ) : """ recursive internal method which works on node level """ if node is None : return None char = key [ depth ] if char < node . character : return _get ( node . left , key , depth ) if char > node . character : return _get ( node . right , key , depth ) if depth < len ( key ) - 1 : return _get ( node . middle , key , depth + 1 ) return node node = _get ( self . root , key , 0 ) if node is None : return - 1 return node . value