51. Who among the following provided the first suffix tree contribution for all alphabet?
52. Which tree allows fast implementation of string operation?
53. Trie is also known as . . . . . . . .
54. What is a time complexity for finding the longest prefix that is common between suffix in a string?
55. Which of the following is true about the trie?
56. Which of the following is the efficient data structure for searching words in dictionaries?
57. A B-tree of order 4 and of height 3 will have a maximum of . . . . . . . . keys.
58. Which of the following data structure can provide efficient searching of the elements?
59. A program to search a contact from phone directory can be implemented efficiently using . . . . . . . .
60. What traversal over trie gives the lexicographical sorting of the set of the strings?
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.