Please answer all of them with a bit of explaination.

4) Convert a binary tree to an array using the 2i+1/2i+2 rule. 5) Convert an existing heap into a heap that results from inserting or deleting a node. 6) Sets and Maps: Write code that adds a mapping to a key-value mapping; write code that displays each value and key