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

If a tree with n nodes has height O(logn), then any function on the tree runs in O(logn) time. True False Question 2 4/4pts Using the node designed for doubly linked list, we can only construct the doubly linked list data structure. True False