Try this exercise. Click the correct answer from the options.
Which of the following statements about tries is true?
Click the option that best answers the question.
- A trie is a tree-like data structure used to store and retrieve strings efficiently.
- Tries are commonly used for tasks such as autocomplete suggestions and spell checking.
- Each node in a trie represents a character and has links to its children nodes.
- Tries are only used for IP routing.
- Trie implementation can be done in any programming language.