def __init__(self):
self._root = []
+ def __iter__(self):
+ return self.inorder(self._root)
+
+ def inorder(self,t):
+ for l in t:
+ yield l.value()
+ for ch in l.children():
+ self.inorder(ch)
+
def _add(self,trie, key, content):
# is the key a leaf
k = key.pop(0)