Top MCQs on Advance Data Structure with Answers

Question 1

Which of the following Statement is true for an AVL tree?

P1: The AVL tree must be a B-tree
P2: The AVL tree must be a Binary Search Tree.
P3: The difference between the heights of left and right subtrees for any node cannot be more than one.
P4: The AVL Tree is a self-balancing tree.

• P1 & P4

• P2 & P4

• P2 & P3

• P2, P3 And P4.

Question 2

What makes an XOR Linked list better than an ordinary linked List?

• XOR linked list uses more memory

• XOR linked list uses less time

• XOR linked list uses less memory than an ordinary Linked list

• None

Question 3

What is the time complexity taken by Red-Black Tree in insertion, deletion, and searching Operations?

• O(N)

• O(1)

• O(h)

• O(LogN)

Question 4

Which operation is used to fix violations in a Red-Black Tree after a node deletion?

• Trimming 

• Recoloring

• Balancing

• None

Question 5

What is the main disadvantage of using a Trie?

•  High memory usage for certain datasets. 

• Slow search speed for long strings

• Limited support for non-string data types. 

• Difficulty in insertion and deletion operations.

Question 6

What is the time complexity for searching an element in the Trie?

• O(1)

• O(LogN)

• O(N)

• O(N^2)

Question 7

What should be placed in the below blank space to complete the find function in Disjoint set?

C++

int find(int i)
{
    if (parent[i] == i) {
        return i;
    }
    else {
        return ________;
    }
}

• i

• 0

• find(i)

• find(parent[i])