Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Implement Trie (Prefix Tree)
Bookmark
Input
Example 1
Example 2
Example 3
Custom
operations
=
[Trie, insert, search, search, startsWith, insert, search]
,
values
=
[null, apple, apple, app, app, app, app]
Operation
-
Word/Prefix
-
Result
-
*
Operation
-
Word/Prefix
-
Result
-
*
Operation
insert
Word/Prefix
"apple"
Result
-
*
a
p
Operation
insert
Word/Prefix
"apple"
Result
-
*
a
p
p
l
e
Operation
search
Word/Prefix
"apple"
Result
-
*
a
p
p
l
e
Operation
search
Word/Prefix
"app"
Result
-
*
a
p
p
l
e
Operation
search
Word/Prefix
"app"
Result
-
*
a
p
p
l
e
Operation
startsWith
Word/Prefix
"app"
Result
-
*
a
p
p
l
e
Operation
insert
Word/Prefix
"app"
Result
-
*
a
p
p
l
e
Operation
search
Word/Prefix
"app"
Result
-
*
a
p
p
l
e
Operation
search
Word/Prefix
"app"
Result
true
*
a
p
p
l
e
algo
master
.
io
Step:
Initialize Trie with root node
0 / 59
Input
Example 1
Example 2
Example 3
Custom
operations
=
[Trie, insert, search, search, startsWith, insert, search]
,
values
=
[null, apple, apple, app, app, app, app]
0 / 59
algo
master
.
io
Step:
Initialize Trie with root node
