Top MCQs on Advance Data Structure with Answers (original) (raw)

Unlike trie(standard) data structure where each node contains 26 pointers for its children, each node in a ternary search tree contains ________ pointers:

Which of the following statements about Tries is false?

• Tries are space-efficient compared to hash tables.
• Tries can efficiently perform prefix searches.
• Tries are typically used for searching in sorted arrays.
• Tries can handle large dictionaries efficiently.

________is an advanced data structure based on a trie that is optimized for palindromic strings.

A self-balancing binary search tree that optimizes for insertions and deletions rather than strict balance is called:

The condition in which Red-Black trees are preferred over AVL trees?

• When tree must be balanced
• When tree must be balanced.
• When there are more insertions or deletions

Which of the following statement is true about Red-Black Tree?

P1: Each Leaf Node and the root node of the Red-Black tree is Black.
P2: The children of a Red node is Black.
P3: The children of a Black Node is Black.
P4: Two adjacent nodes can be Red.

Which one of the following data structures is preferred in database-system implementation?

Which of the following is the self-balancing binary search tree?

Which of the following is the application of the BK - Tree?

• Approximate string matching

What is the necessary condition for the Cartesian Tree?

• An inorder traversal of the nodes yields the values in the same order

There are 25 questions to complete.

Take a part in the ongoing discussion