Top MCQs on Advance Data Structure with Answers

Question 11

What is a generic tree?

• A tree in which each node has at most two children.

• A tree in which all nodes have the same value.

•  A tree in which each node can have an arbitrary number of children

• A tree with no cycles.

Question 12

Which of the following is rotation in splay tree.

• Zig- Zag Rotation

• Zag Rotation

• Zag - Zag Rotation

• All of these

Question 13

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

• Only 2

• Only 3

• Only 1

• None

Question 14

Path Compression algorithm used in the Union-Find (Disjoint-Set) data structure,  performs in which of the following operations?

• Create operation

•  Insert operation

• Find operation

• Delete operation

Question 15

Which of the following is the application of the Trie?

• Integer arithmetic operations. 

• Pattern Searching

• Sorting and merging large datasets. 

•  Implementation of Heap

Question 16

Which of the following is true about persistence data structure?

• The data structure should be sorted.

• Insertion is done in O(1) 

• Always stores the previous data

• None

Question 17

What is the necessary condition for the Cartesian Tree?

• Binary Tree

• Binary Search Tree

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

• None

Question 18

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

• Spell checker

• Approximate string matching

• Both of the above

• None

Question 19

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

• AVL Tree

• Red Black Tree

• Splay Tree

• All of the Above

Question 20

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

• Binary Search tree

• B+ tree

• Splay Tree

• AVL tree