These questions are from Data Structures. Please answer each part of the question in details as to why each of the answer correct and why the other options are wrong. Please provide details. For sufficient answer quality, I'd give a thumbs up and otherwise if the answer is short and not understood. Please explain as if you are explain the concept to a kid. Please answer all parts of the questions shown

The worse case for insertion in a hash table without deletion happens when the hash table is extremely large and all the slots are filled with values except one. True False Question 4 4 / 4 pts In a binary tree, the nodes on the left of the root contain values smaller than the value in the root, while the nodes on the right of the root contain values larger than the root. True False