LintCode & LeetCode
search
⌘Ctrlk
LintCode & LeetCode
  • Introduction
  • Linked List
  • Binary Search
  • Hash Table
  • String
  • Array
  • Matrix
  • Queue
  • Stack
  • Heap
  • Data Structure & Design
  • Union Find
  • Trie
    • Implement Trie
    • Add and Search Word
    • Word Search II
    • Longest Word in Dictionary
    • Palindrome Pairs
    • Trie Serialization
    • Trie Service
    • Design Search Autocomplete System
    • Typeahead
  • Trees
  • Segment Tree
  • Binary Indexed Tree
  • Graph & Search
  • Backtracking
  • Two Pointers
  • Mathematics
  • Bit Operation
  • Random
  • Dynamic Programming
  • Knapsack
  • High Frequency
  • Sorting
  • Greedy
  • Minimax
  • Sweep Line & Interval
  • Other Algorithms and Data Structure
  • Company Tag
  • Problem Solving Summary
  • Reference
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Trie

hashtag
Reference

  • The Trie: A Neglected Data Structurearrow-up-right

  • ProgramCreek: LeetCode – Implement Trie (Prefix Tree) (Java)arrow-up-right

PreviousRedundant Connectionchevron-leftNextImplement Triechevron-right

Last updated 5 years ago