Trie - I

What is the primary purpose of a trie data structure?

• To manage binary data

• To facilitate quick search results

• To sort data alphabetically

• To store numerical data efficiently

In a trie, what does the root node typically connect to?

• All possible words

• All possible sentences

• All possible numbers

• All possible characters

How does a trie differ from a binary tree?

• A trie is used for numerical operations

• A trie can connect to multiple nodes

• A trie is a type of binary tree

• A trie can only connect to two nodes

What is an enary tree in the context of tries?

• A tree with exactly three children per node

• A tree with exactly two children per node

• A tree with a variable number of children per node

• A tree with no children

What advantage does a trie have over an array for word searches?

• Tries can store more data

• Tries allow for faster searches by reducing the search space

• Tries are easier to implement

• Tries use less memory

How does a trie improve search efficiency compared to an array?

• By storing data in a linear fashion

• By reducing the number of comparisons needed

• By using more memory

• By sorting data alphabetically

How are ASCII values used in a trie?

• To encrypt data

• To determine the position of characters

• To compress data

• To sort data alphabetically

What is the significance of the ASCII value 97 in a trie?

• It is used to encrypt data

• It is used to calculate the position of 'a'

• It represents the character 'z'

• It represents the character 'b'

What is the role of the 'word end' value in a trie?

• To indicate the start of a word

• To mark the end of a word

• To store the length of a word

• To sort words alphabetically

How does a trie help in tracking words in a custom dictionary?

• By using a variable to mark word endings

• By storing words in a list

• By compressing the dictionary

• By sorting words alphabetically