Recover the BST

What does the in-order traversal of a BST produce?

• a) Nodes in sorted order

• b) Nodes in reverse sorted order

• c) Nodes in random order

• d) Nodes in the order they were inserted

Which of the following algorithms can be used for recovering a BST after a deletion?

• a) Breadth-first search (BFS)

• b) Depth-first search (DFS)

• c) In-order traversal

• d) Dijkstra's algorithm

In topological sorting, vertices with no incoming edges are processed:

• First

• Last

• Randomly

• In any order

Which of the following data structures is commonly used to implement topological sorting?

• Queue

• Stack

• Array

• Heap

Which of the following operations can lead to the need for recovering a BST?

• a) Insertion

• b) Deletion

• c) Searching

• d) Traversal

What is the Dial's Algorithm most suitable for?

• Graphs with negative edge weights

• Graphs with positive edge weights

• Graphs with non-negative edge weights and a limited range of weights

• Graphs with arbitrary edge weights

What is the primary purpose of recovering a Binary Search Tree (BST)?

• a) To optimize its search operation

• b) To ensure its structural integrity after modifications

• c) To reduce its memory consumption

• d) To increase its traversal speed

What is a binomial tree?

• a) A tree where each node has at most two children

• b) A tree where each node has exactly two children

• c) A tree with a specific ordering of nodes

• d) A tree used in binary search algorithms

Which of the following is NOT a step in recovering a BST after a deletion?

• a) Finding the node to be deleted

• b) Deleting the node

• c) Rebalancing the tree

• d) Reorganizing the tree to maintain the binary search property

After recovering a BST following a deletion, what operation should be performed to ensure the tree is balanced?

• a) Rotate the tree

• b) Reorder the nodes

• c) Recalculate the heights of all nodes

• d) Perform a rebalancing operation like AVL or Red-Black tree rotations