DSA Quiz

Which traversal of binary search tree outputs the value in sorted order?

• Pre-order
• Post-order
• In-Order
• None

A binary search tree by inserting in order the following integers: 50, 22, 15, 62, 77, 5, 9, 100, 20, 58, 91, 3, 8, 37, 60, 24, The number of the node in the left sub-tree and right sub-tree of the root, respectively, is

• (10,5)
• (8,7)
• (7,8)
• (9,6)

What is the MINIMUM number of nodes in a binary search tree of height = 5?

• 6
• 5
• 4
• None

When deleting from a binary search tree, if the node being deleted has 2 children, we replace the entry with ____.

• the inorder successor
• the left child
• the right child
• None

If I deleted the root from the Binary Search Tree what could I replace it with?

• 52
• 70
• 30
• 75

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

• 2
• 4
• 3
• 5

What is the minimum possible height of an AVL tree with 7 nodes?

• 2
• 3
• 1
• 4

For RL imbalance which rotation is need to balance the tree

• Single LL rotation
• Single RR rotation
• None
• LL and RR rotation

The MAX-HEAPIFY function will swap the parent node with the ________ child node on a mismatch.

• larger
• smaller
• Left
• right

The running time of MAX-HEAPIFY function is

• O(n)
• O{n^2)
• O(logn)
• O(nlogn)