Stack is a linear data structure that follows the Last In, First Out (LIFO) principle. It supports two primary operations: push, to add an element onto the stack, and pop, to remove the top element.

Queue is a linear data structure that follows the First In, First Out (FIFO) principle. It supports two operations: enqueue, to add an element to the back of the queue, and dequeue, to remove the front element.

A linked list is a linear data structure where each element, known as a node, consists of data, a reference to the next node, and sometimes a reference to the previous node in the sequence.

Tree is a hierarchical data structure composed of nodes, each containing a value and references to its child nodes. It has a single root node from which all other nodes stem, forming a branching structure.

Graph is a complex non-linear structure consisting of nodes and edges connecting them, modeling relationships between objects with connectivity and directionality.

Sorting is the process of arranging elements in a specific order, typically ascending or descending. It is a fundamental operation in computer science and is used for organizing data efficiently.