private Trie<String, Integer> makeTrie() {
        Trie<String, Integer> t = new Trie<>(String::compareToIgnoreCase, new TestLookupComparator());

        t.add(List.of("5", "1", "2", "3", "4"), 1);
        t.add(List.of("5", "2", "3", "4"), 2);
        t.add(List.of("5", "1", "3", "4"), 3);
        t.add(List.of("5", "1", "2"), 4);
        t.add(List.of("5", "1"), 5);
        t.add(List.of("5", "1", "2", "4"), 6);
        t.add(List.of("5", "1xa", "2"), 7);
        t.add(List.of("5", "1yb", "2"), 8);
        t.add(List.of("5", "1yc", "2"), 9);
        t.add(List.of("5", "1yd", "2"), 10);
        t.add(List.of("5", "1ze", "2"), 11);
        t.add(List.of("5", "1y"), 12);
        t.add(Arrays.asList("5", "1", "2", "", "4"), 13);

        return t;
    }
Build-up a trie of the following structure:
<pre>
              "5"
             /  \
            /    \
          "1"5)  "2"
         /   \      \
        /     \      \
      "2"4)   "3"    "3"
      / \       \      \
     /   \       \      \
   "3"   "4"6)   "4"3)  "4"2)
   /
  /
"4"1)
</pre>
Also augmented with some extra nodes at the level of "1"5) considered partially comparable
@return
test/org.jkiss.dbeaver.test.platform/src/org/jkiss/dbeaver/model/sql/parser/TrieTest.java