Advanced Trees _Avl_ Redblack_ Btrees — Part 2 MCQs with Explanations

Better worst-case time complexity for balancing. is the correct answer to “What is a key advantage of using a Red-Black tree over a standard Binary Search Tree”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

It is balanced and requires no changes. is the correct answer to “In an AVL tree, what happens when a node has a balance factor of 0”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Keys are stored in sorted order. is the correct answer to “How is a B-Tree node typically structured”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

They guarantee balanced height but not exact height. is the correct answer to “Which of the following is true for Red-Black trees”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

26 is the correct answer to “What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

True is the correct answer to “Can suffix tree be used in bioinformatics problems and solutions.”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

B+ -tree is the correct answer to “Which one of the following data structures are preferred in database-system implementation”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Ɵ (n + x) is the correct answer to “What is a time complexity for x pattern occurrence of length n”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Linear to Length of Tree is the correct answer to “How much time does construction of suffix tree take”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

The tree has n leaves. is the correct answer to “Which statement is correct of suffix tree with a string of length n”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Farach is the correct answer to “Who among the following provided the first suffix tree contribution for all alphabet”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Suffix Tree is the correct answer to “Which tree allows fast implementation of string operation”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Digital Tree is the correct answer to “Trie is also known as . . . . . . . .”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Ɵ (1) is the correct answer to “What is a time complexity for finding the longest prefix that is common between suffix in a string”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

path from root to the leat yields the string is the correct answer to “Which of the following is true about the trie”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Trie is the correct answer to “Which of the following is the efficient data structure for searching words in dictionaries”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

255 is the correct answer to “A B-tree of order 4 and of height 3 will have a maximum of . . . . . . . . keys.”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

2-3 tree is the correct answer to “Which of the following data structure can provide efficient searching of the elements”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

a trie is the correct answer to “A program to search a contact from phone directory can be implemented efficiently using . . . . . . . .”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

inorder is the correct answer to “What traversal over trie gives the lexicographical sorting of the set of the strings”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

O (1) is the correct answer to “What is a time complexity for inserting an alphabet in the tree using hash maps”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

O (n log n) is the correct answer to “What is the time complexity of Uttkonen's algorithm”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Generalized Suffix Tree is the correct answer to “Which tree allows fast implementation of a set of string operation”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

O (n2) is the correct answer to “What is a time complexity for finding the total length of all string on all edges of a tree”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Farach's algorithm is the correct answer to “Who among the following algorithm is used in external memory and compression of the suffix tree”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

3 is the correct answer to “A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Suffix tree is the correct answer to “Which of the following special type of trie is used for fast searching of the full texts”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

n! nodes is the correct answer to “For what size of nodes, the worst case of usage of space in suffix tree seen”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

node = node.children[index] is the correct answer to “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; }”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Ɵ (n) is the correct answer to “What is a time complexity for finding the longest substring that is repeated in a string”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Ɵ (n1 + n2) is the correct answer to “What is a time complexity for finding the longest substring that is common in string S1 and S2 (n1 and n2 are the string lengths of strings s1, s2 respectively)”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Linear Time is the correct answer to “What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

PAT Tree is the correct answer to “What is the other name for Suffix Tree”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

False is the correct answer to “AVL trees provide better insertion the 2-3 trees.”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Weiner is the correct answer to “Who proposed the concept of Suffix Tree”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

between log3(n + 1) and log2(n + 1) is the correct answer to “The height of 2-3 tree with n elements is . . . . . . . .”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Ukkonen is the correct answer to “Who among the following provided the first online contribution of Suffix Tree”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Statement 1 is true but statement 2 is false is the correct answer to “Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node. Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

11 is the correct answer to “Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.

Red-Black is the correct answer to “2-3-4 trees are B-trees of order 4. They are an isometric of . . . . . . . . trees.”. This question is standard in competitive examination syllabi for Advanced Trees _Avl_ Redblack_ Btrees.