Fixing the inorder iterator. Did not recurse deep enough before.

diff --git a/src/tree-cutter.py b/src/tree-cutter.py
index d0b40c049a75c905b18ce1c8a1b63ed73ef06a8c..02164390276de44978171c1ae21813fed213b66c 100755 (executable)
--- a/src/tree-cutter.py
+++ b/src/tree-cutter.py
@@ -233,8 +233,8 @@ class Trie():
     def inorder(self,t):
         for l in t:
             yield l.value()
-            for ch in l.children():
-                self.inorder(ch)
+            for x in self.inorder(l.children()):
+                yield x
 
     def _add(self,trie, key, content):
         # is the key a leaf