From 0bc7deb3afc4de84b96079f29accada84b2e299c Mon Sep 17 00:00:00 2001 From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com> Date: Mon, 31 Jul 2023 18:48:02 -0700 Subject: [PATCH] Update README.md --- tries/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/tries/README.md b/tries/README.md index 962f017..cdb5338 100644 --- a/tries/README.md +++ b/tries/README.md @@ -7,7 +7,7 @@ * the root is associated with the empty string. * the * nodes (null nodes) are often used to indicate complete words (usually represented by a special type of child) or a boolean flag that terminates the parent node. * a node can have anywhere from 1 through alphabet_size + 1 child. -* can be used to store the entire english language for quick prefix lookup (O(k), where k is the length of the string). they are also widely used on autocompletes, spell checkers, etc. +* can be used to store the entire english language for quick prefix lookup (O(k), where k is the length of the string). they are also widely used on autocompletes, spell checkers, and ip routing (longest prefix matching). * tries structures can be represented by arrays and maps or trees.