From b8d4a9ff295dbf6b85c700add6bbcb3aded00fc9 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 4 Dec 2023 23:42:23 -0500 Subject: [PATCH] adding the trie implementation --- lectures/27_hybrid_data_structures/README.md | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/lectures/27_hybrid_data_structures/README.md b/lectures/27_hybrid_data_structures/README.md index 5e5772d..5637125 100644 --- a/lectures/27_hybrid_data_structures/README.md +++ b/lectures/27_hybrid_data_structures/README.md @@ -101,3 +101,8 @@ for the key (or NULL or a special value, e.g., ’-1’, if the path to that poi - What is the worst case # of children for a single node? What are the member variables for the Node class? - Unlike a hash table, we can iterate over the keys in a trie / prefix tree in sorted order. Exercise: Implement the trie sorted-order iterator (in code or pseudocode) and print the table on the right. + +## 27.8 Leetcode Exercises + +- [Leetcode problem 208: Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/). Solution: [p208_trie.cpp](../../leetcode/p208_trie.cpp). +