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

We insert 1,2,3,4,5,6,7 into a binary search tree. How many different insertion orders will give us a full binary tree? Question 11 0/4 pts In a singly linked list, pointer p is pointing to a node not at the beginning, r is pointing to a node not at the end. There is another pointer q such that p> next =q and q> next=r. How many link changes are needed if we physically swap nodes pointed by p and r