Question No. 1: MCQs. Write correct option (A, B, C or D) against each question on answer sheet CL02 10 Marks 1. The tree data structure is a a. Linear data structure b. Non-linear data structure C. Graphical data structure d. Data structure like queue 2. The easiest case of deleting a node from Binary Search Tree is the case in which the node to be deleted a. is a leaf node b. Has left subtree only C. Has right subtree only d. Has both left and right subtree 3. If there are N internal nodes in a binary tree, then what will be the no. of external nodes in this binary tree? a. N-1 b. N c. N +1 d. N +2 4. A binary tree of N nodes has a. Logo N levels b. Log2 N levels C. N/2 levels d. Nx 2 levels 5 If there are 56 internal nodes in a binary tree, then how many external nodes this binary tree will have? a. 54 b. 55 C. 56 d. 57 Page 1 of 3 6. A complete binary tree of height__ has nodes between 16 to 31. a. 2 b. 3 C. 4 d. 5 7 The maximum number of external nodes (leaves) for a binary tree of height His a. 2M b. 2H+1 c. 2H-1 d. 24+2 8. While building Huffman encoding tree, the new node that is the result of joining two nodes has the frequency a. Equal to the small frequency b. Equal to the greater frequency C. Equal to sum of the two frequencies d. Equal to difference of the two frequencies to develop codes of varying lengths for the letters used in the 9. Huffman encoding uses original message. a. Linked list b. Stack C. Queue d. Binary tree cases for rotation in an AVL tree. 10. 21. During insertion, there are a. 2 b. 3 C. 4 d. 5