No. The Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.
Sequential is the simplest file structure.
According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one.
It is said to be complete when each node that has a right child also has a left child. Having a left child does not require a node to have a right child. Alternate Binary tree is a tree where their is always a left node for right node but may be may not be right node for left node.
AVL tree is self balancing tree, in which balancing factor lie between the -1 to 1.