Introduction

• A Trie is a special form of a N-ary tree. Typically, a trie is used to store strings
• Each Trie node represents a string (a prefix)
• Each node might have several children nodes while the paths to different children nodes represent different characters
• The strings, the child nodes represent, will be the origin string represented by the node itself plus the character on the path

You Will Know

• topic1

Why Should You Learn These

Contents

Click cmd/ctrl + option/alt + T to expand all toggles

1. Example of a Trie

2. How to represent a Trie?

3. Basic Operations

Conclusions

References

• link1

Further Readings

• a further reading for topic 1

Note