Answer Happy

only do if u can do all questions please
Ise 1. 2. 3 4. Section 2. Please pick only one answer T for True or Flor 1. Lineal probing of hashing collision resolution can cause clustering. 2. A binary tree is complete if every level of the tree is full except that the last level may not be full and all the leaves on the last level are placed left-most. 3. A heap is a full binary tree. 4. A heap can be represented using an array. The array (2 3 5 6 10 4) is a maximum heap. a 5. A heap can be represented using an array. The array {63 41 58 31 38 43) is not a maximum heap 6. In a binary search tree, the element to be removed is always at the root. 7. A new element is always inserted into a leaf node of a Binary Search tree. 8. TreeNode is defined as an inner class inside BST. ale naster than or equal to any of its children 5. ON . 8.