Search⌘ K
AI Features
Home
Courses
Data Structures for Coding Interviews in Python

Challenge: Find All Words Stored in Trie

Explore how to implement a function that retrieves all words stored in a trie data structure using Python. Understand trie traversal techniques and apply them to solve common challenges in coding interviews.

We'll cover the following...

Statement

Given a trie data structure representing a list of words, implement a function that finds and returns all words stored in the trie.

Constraints:

  • 0≤0\leq words.length ≤103\leq 10^3

  • 1≤ 1\leq words[i].length ≤102\leq10^2

  • All words[i] consist of lowercase English letters.

Examples

canvasAnimation-image
1 / 3

Try it yourself

Implement your solution in solution.py in the following coding playground.

Python
usercode > solution.py
from Trie import Trie
from TrieNode import TrieNode
    
def find_words(root):
    
    # Replace this placeholder return statement with your code
    return []
Find All Words Stored in Trie