CS301P Final Term MCQs by Miss Mehwish

CS301p · Final Term (Live Quiz) · Past Papers for Mids./Finals are also Available

1. If the data is given in sorted order, the tree generated will be similar to __________. Queue

Stack [✔] Heap

2. If you create a BST with data that is sorted in an ascending or descending order, it will be similar to:

Complete Binary Tree AVL tree Strictly Binary Tree

Q3. Which type of rotation can balance the following AVL tree?

(Tree: 15 -> 20 -> 18)

Q4. Which type of rotation can balance the following AVL tree?

(Tree: 11 -> 16 -> 12)

Q5. Which of the following function prototype is declaring the function as constant?

Q6. Which of the following function is returning a const value?

7. Choose the correct option that why the following tree is not an AVL tree. (Tree: 2 -> 4 -> 8 -> 11 -> 13)
8. In the given BST, the balance factor of the root node is:

-1

[✔] 1 -2

Q9. What will be the height of an empty AVL tree?

-1 [✔] 0

10. The balance of a node in a binary search tree is defined as the __________.

[✔] height of its left subtree - height of its right subtree height of its right subtree - height of root node height of its left subtree - height of its leaf nodes height of its right subtree + height of its left subtree

1. The balance of a node in a binary search tree is defined as the:

* height of its right subtree + height of its left subtree * height of its left subtree - height of its leaf nodes * height of its right subtree - height of root node * ✓ height of its left subtree - height of its right subtree

Q2. What will be the height of an empty AVL tree?

* ✓ -1 * 0 * 1