1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
import { assertEquals } from "../deps.ts";import { TrieNode } from "../implement-trie-ii-prefix-tree/TrieNode.ts";import { TrieNodeInsert } from "../implement-trie-ii-prefix-tree/TrieNodeInsert.ts";import { TrieNodeClear } from "./TrieNodeClear.ts";import { TrieNodeForEach } from "./TrieNodeForEach.ts";
Deno.test("TrieNode-for-each-Insert-clear", () => {    const words = [        "1",        "32",        "123",        "21",        "222",        "132",        "111",        "312",        "hello",        "world",        "world",        "world",        "ffff",        "ffff",        "ffff",        "ffff",        "ffff",    ];    const tree = new TrieNode();    words.forEach((word) => TrieNodeInsert(tree, word));    const left = Array.from(words);
    const temp: string[] = [];    TrieNodeForEach(tree, (w) => temp.push(w));    assertEquals(Array.from(left).sort(), Array.from(temp).sort());
    TrieNodeClear(tree);    const empty: string[] = [];    TrieNodeForEach(tree, (w) => empty.push(w));    assertEquals([], empty);});