# 100+ Trie (Data Structure) MCQs with FREE PDF

We have the best collection of Trie (Data Structure) MCQs and answer with FREE PDF. These Trie (Data Structure) MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Trie (Data Structure) MCQs

#### 1. Which of the following is not true?

a) Trie requires less storage space than hashing

b) Trie allows listing of all the words with same prefix

c) Tries are collision free

d) Trie is also known as prefix tree

Answer: Trie requires less storage space than hashing

#### 2. A program to search a contact from phone directory can be implemented efficiently using ______

a) a BST

b) a trie

c) a balanced BST

d) a binary tree

a) log2n

b) log2m

c) n

d) m

#### 4. Which of the following is true about the trie?

a) root is letter a

b) path from root to the leat yields the string

c) children of nodes are randomly ordered

d) each node stores the associated keys

Answer: path from root to the leat yields the string

a) Digital Tree

b) Treap

c) Binomial Tree

d) 2-3 Tree

a) postorder

b) preorders

c) inorder

d) level order

a) BST

c) Balancded BST

d) Trie

a) Ctrie

b) Hash tree

c) Suffix tree

d) T tree

#### 9. Which statement is correct of suffix tree with a string of length n?

a) The tree has n leaves

b) The tree has n roots

c) Height of Tree is n

d) Depth of tree is n

Answer: The tree has n leaves

#### 10. Which tree allows fast implementation of a set of string operation?

a) Rope Tree

b) Tango Tree

c) Generalized Suffix Tree

d) Top Tree

Answer: Generalized Suffix Tree

a) O (log n!)

b) O (n!)

c) O (n2)

d) O (n)

#### 12. What is the other name for Suffix Tree?

a) Array

b) Stack

c) Priority Queue

d) PAT Tree

a) Rope Tree

b) Suffix Tree

c) Tango Tree

d) Top Tree

#### 14. How much time does construction of suffix tree take?

a) O (log M)

b) O (M!)

c) Exponential to Length of Tree

d) Linear to Length of Tree

Answer: Linear to Length of Tree

#### 15. How much space does construction of suffix tree takes?

a) O (log M)

b) Exponential to Length of Tree

c) O (M!)

d) Linear to Length of Tree

Answer: Linear to Length of Tree

a) Rope Tree

b) Suffix Tree

c) Tango Tree

d) Top Tree

#### 17. Who among the following provided the first online contribution of Suffix Tree?

a) Weiner

b) Samuel F. B. Morse

c) Ukkonen

d) Alexander Morse

#### 18. What is the time complexity of Uttkonen’s algorithm?

a) O (log n!)

b) O (n!)

c) O (n2)

d) O (n log n)

Answer: O (n log n)

#### 19. Who among the following provided the first suffix tree contribution for all alphabet?

a) Weiner

b) Farach

c) Ukkonen

d) Alexander Morse