Linked-list can insert unlimited nodes? (1 Mark) b. No a. Yes 2. From Linked List it is possible to access any Node through array subscript [ 1? (1 Mark) b. No .. Yes 3. The head pointer of Linked-List always points to the last node of linked-list? (1 Mark) b. No .. Yes 4. In binary search tree, larger values go to the left child nodes? (1 Mark) b. No a Yes 5. A good hash function should provide distinct (unique) hash value to each key? (1 Mark) a. Yes b. No 6. Binary search tree is always balanced? (1 Mark) b. No 2. Yes 7. The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? (1 Mark) b. 2 c. 3 d. 4 & While inserting the numbers 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is: (1 Mark) a. 65 b. 67 c. 69 d. 83