From 83644ee3d1a7739402d7cd6b6785a7c764b621e5 Mon Sep 17 00:00:00 2001 From: John Washam Date: Fri, 15 Jul 2016 22:24:29 -0700 Subject: [PATCH] Tries are complete. --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 6e7760e..0b4cb39 100644 --- a/README.md +++ b/README.md @@ -440,7 +440,7 @@ Then test it out on a computer to make sure it's not buggy from syntax. - [x] heap_sort() - take an unsorted array and turn it into a sorted array in-place using a max heap - note: using a min heap instead would save operations, but double the space needed (cannot do in-place). -- [ ] **Tries** +- [x] **Tries** - Note there are different kinds of tries. Some have prefixes, some don't, and some use string instead of bits to track the path. - I read through code, but will not implement. @@ -452,7 +452,7 @@ Then test it out on a computer to make sure it's not buggy from syntax. - [x] The Trie: A Neglected Data Structure: https://www.toptal.com/java/the-trie-a-neglected-data-structure - [x] TopCoder - Using Tries: https://www.topcoder.com/community/data-science/data-science-tutorials/using-tries/ - [x] Stanford Lecture (real world use case): https://www.youtube.com/watch?v=TJ8SkcUSdbU - - [ ] MIT, Advanced Data Structures, Strings: https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf + - [x] MIT, Advanced Data Structures, Strings: https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf - [x] **Balanced search trees** - Know least one type of balanced binary tree (and know how it's implemented):