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: A list of pairs of the edges from this node and the nodes they point
  to.
  
  Examples:
      >>> from featuretools.utils import Trie
      >>> trie = Trie(default=str)
      >>> trie.get_node([1, 2]).value = '12'
      >>> trie.get_node([3]).value = '3'
      >>> children = trie.children()
      >>> first_edge, first_child = children[0]
      >>> first_edge
      1
      >>> first_child.value
      ''
      >>> second_edge, second_child = children[1]
      >>> second_edge
      3
      >>> second_child.value
      '3'
docstr_tok: ["A","list","of","pairs","of","the","edges","from","this","node","and","the","nodes","they","point","to",".","Examples",":",">",">",">","from","featuretools.utils","import","Trie",">",">",">","trie","=","Trie","(","default=str",")",">",">",">","trie.get_node","(","[","1",",","2","]",")",".value","=","'12'",">",">",">","trie.get_node","(","[","3","]",")",".value","=","'","3'",">",">",">","children","=","trie.children","(",")",">",">",">","first_edge",",","first_child","=","children","[","0","]",">",">",">","first_edge","1",">",">",">","first_child.value","``",">",">",">","second_edge",",","second_child","=","children","[","1","]",">",">",">","second_edge","3",">",">",">","second_child.value","'","3","'"]
code: def children(self):
      """
      A list of pairs of the edges from this node and the nodes they point
      to.
  
      Examples:
          >>> from featuretools.utils import Trie
          >>> trie = Trie(default=str)
          >>> trie.get_node([1, 2]).value = '12'
          >>> trie.get_node([3]).value = '3'
          >>> children = trie.children()
          >>> first_edge, first_child = children[0]
          >>> first_edge
          1
          >>> first_child.value
          ''
          >>> second_edge, second_child = children[1]
          >>> second_edge
          3
          >>> second_child.value
          '3'
      """
      return list(self._children.items())
  
label_desc: Use image node_id 2 for calling the Trie obj's underlying member method code with example usage: obj.children() and returns: list