class_docstr: A trie (prefix tree) where the keys are sequences of hashable objects.
  
  It behaves similarly to a dictionary, except that the keys can be lists or
  other sequences.
  
  Examples:
      >>> from featuretools.utils import Trie
      >>> trie = Trie(default=str)
      >>> # Set a value
      >>> trie.get_node([1, 2, 3]).value = '123'
      >>> # Get a value
      >>> trie.get_node([1, 2, 3]).value
      '123'
      >>> # Overwrite a value
      >>> trie.get_node([1, 2, 3]).value = 'updated'
      >>> trie.get_node([1, 2, 3]).value
      'updated'
      >>> # Getting a key that has not been set returns the default value.
      >>> trie.get_node([1, 2]).value
      ''
class_docstr_tok: ["A","trie","(","prefix","tree",")","where","the","keys","are","sequences","of","hashable","objects",".","It","behaves","similarly","to","a","dictionary",",","except","that","the","keys","can","be","lists","or","other","sequences",".","Examples",":",">",">",">","from","featuretools.utils","import","Trie",">",">",">","trie","=","Trie","(","default=str",")",">",">",">","#","Set","a","value",">",">",">","trie.get_node","(","[","1",",","2",",","3","]",")",".value","=","'123'",">",">",">","#","Get","a","value",">",">",">","trie.get_node","(","[","1",",","2",",","3","]",")",".value","'123'",">",">",">","#","Overwrite","a","value",">",">",">","trie.get_node","(","[","1",",","2",",","3","]",")",".value","=","'updated'",">",">",">","trie.get_node","(","[","1",",","2",",","3","]",")",".value","'updated'",">",">",">","#","Getting","a","key","that","has","not","been","set","returns","the","default","value",".",">",">",">","trie.get_node","(","[","1",",","2","]",")",".value","``"]
docstr: Iterate over all values in the trie. Yields tuples of (path, value).
  
  Implemented using depth first search.
docstr_tok: ["Iterate","over","all","values","in","the","trie",".","Yields","tuples","of","(","path",",","value",")",".","Implemented","using","depth","first","search","."]
code: def __iter__(self):
      """
      Iterate over all values in the trie. Yields tuples of (path, value).
  
      Implemented using depth first search.
      """
      yield self._path_constructor([]), self.value
  
      for key, sub_trie in self.children():
          path_to_children = self._path_constructor([key])
  
          for sub_path, value in sub_trie:
              path = path_to_children + sub_path
              yield path, value
  
label_desc: Use image node_id 4 for calling the Trie obj's underlying member method code with example usage: obj.__iter__() without return types