61. What is a time complexity for inserting an alphabet in the tree using hash maps?
62. What is the time complexity of Uttkonen's algorithm?
63. Which tree allows fast implementation of a set of string operation?
64. What is a time complexity for finding the total length of all string on all edges of a tree?
65. Who among the following algorithm is used in external memory and compression of the suffix tree?
66. A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves?
67. Which of the following special type of trie is used for fast searching of the full texts?
68. For what size of nodes, the worst case of usage of space in suffix tree seen?
69. Following code snippet is the function to insert a string in a trie. Find the missing line.
private void insert(String str)
{
TrieNode node = root;
for (int i = 0; i < length; i++)
{
int index = key.charAt(i) - 'a';
if (node.children[index] == null)
node.children[index] = new TrieNode();
________________________
}
node.isEndOfWord = true;
}
private void insert(String str)
{
TrieNode node = root;
for (int i = 0; i < length; i++)
{
int index = key.charAt(i) - 'a';
if (node.children[index] == null)
node.children[index] = new TrieNode();
________________________
}
node.isEndOfWord = true;
}70. Which of the following is false?
Read More Section(Advanced Trees (AVL, RedBlack, BTrees))
Each Section contains maximum 100 MCQs question on Advanced Trees (AVL, RedBlack, BTrees). To get more questions visit other sections.