50 TO 100

What is the worst-case time complexity for searching for a node in an unbalanced Binary Search Tree (BST)?

• O(n)
• O(log n)
• O(n^2)
• O(log log n)

What is the main advantage of a B Tree over a Binary Search Tree (BST)?

• B Trees are always balanced.
• B Trees allow searching in O(log n) time.
• B Trees store more than one element in each node.
• All of the above.

In a 2-3 Tree, what is the maximum number of children that any node can have?

• 1
• 2
• 3
• 4

Which of the following is true for a 2-3-4 Tree?

• It is a balanced tree with a variable number of children in each node.
• It is not a type of balanced tree.
• It allows up to 4 children per node.
• Both a and c.

Which of the following is an application of Binary Search Trees?

• Implementing a priority queue
• Implementing dynamic sets
• Storing unique elements
• All of the above

Which of the following statements is true for an AVL tree after an insertion operation?

• It may need to be rebalanced.
• It is always balanced after insertion.
• The height of the tree increases by 2.
• No balancing is necessary after insertion.

Which traversal is used for printing the elements of a tree in post-order?

• Visit left subtree, visit right subtree, visit root.
• Visit root, visit left subtree, visit right subtree.
• Visit root, visit right subtree, visit left subtree.
• Visit left subtree, visit root, visit right subtree.

Which of the following operations is used for balancing an AVL tree?

• Left Rotation
• Right Rotation
• Left-Right Rotation
• All of the above

What is the time complexity of insertion in a Binary Search Tree (BST) in the worst case?

• O(log n)
• O(n)
• O(n^2)
• O(1)

Which of the following is true for a Trie data structure?

• It is used for storing and searching strings efficiently.
• It stores only unique values.
• It stores strings by sharing common prefixes.
• All of the above.