Question: 1. Can we use the location in an array with index 0 for a node in a heap data structure? (a) yes (b) no 2.

1. Can we use the location in an array with index 0 for a node in a heap data structure? (a) yes (b) no 2. Is it possible that a given heap is not a complete binary tree? (a) yes (b) no 3. Given a node in a heap with 2023 total nodes, if we know that this node does not have any right-child node, can we say that this node must be a leaf? (a) yes (b) no 4. When we design a hash function for a hashtable data structure, we consider two methods: the division method and the multiplication method. Which one do you think is better? (a) the division method (b) the multiplication method
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
