Final answer:
A linear list where deletion occurs at the front and insertion at the rear is known as a Queue, which follows the first-in, first-out (FIFO) principle.
Step-by-step explanation:
The linear list of elements where deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a Queue.
A queue follows a first-in, first-out (FIFO) principle, meaning that the first element added to the list will be the first one to be removed. This is analogous to a line of people waiting for service where the person who comes first gets served first and leaves from the front, while new arrivals join the line at the rear. In contrast, a Stack follows a last-in, first-out (LIFO) approach, where elements can be added and removed from only one end. A Linked List is a sequential collection of elements, where each element points to the next, allowing for efficient insertion and deletion at any position. A Tree, on the other hand, is a hierarchical structure with nodes having potential multiple paths from root to leaf, not adhering to the FIFO or LIFO principles of queues and stacks respectively.