2022.04.17 18:15:44 (1515725710811295749) from Daniel J. Bernstein, replying to "Nick Bouliane 🦈 (@nicboul)" (1514451354462261249):
A trie looks up string x by taking node0 = root, node1 = node0.child(x[0]), node2 = node1.child(x[1]), etc., each x[i] typically being a byte. A crit-bit tree takes node0 = root, node1 = node0.child(x[node0.bitpos]), node2 = node1.child(x[node1.bitpos]), etc.
2022.04.14 05:51:54 (1514451354462261249) from "Nick Bouliane 🦈 (@nicboul)":
can a crit-bit tree also be called a trie ? if not, why ? thanks !