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.

A splay tree is a binary search tree with the following balancing condition: For each node v, the difference between the height of its left subtree and the height of its right subtree is not larger than 1. True False Question 3 3/3 pts The worst case running time of search() in a hash table with deletion is O(n) where n is the size of the hash table. True False