Where Ideas
Meet Code

Data Structure & Algorithm Mid term question answer

A tree is a non-linear, hierarchical data structure. Instead of a straight line, data branches out like an upside-down real tree: the root is at the top and leaves at the bottom.

A Linked List is a linear data structure in which elements (called nodes) are stored at non-contiguous memory locations and connected together using pointers (references). Unlike arrays, the size of a linked list is dynamic — it can grow or shrink during program execution.

A queue is a linear data structure that follows the FIFO (First In, First Out) principle — the element inserted first is the first one to be removed.

A stack is a linear data structure that follows the LIFO (Last In, First Out) principle — the element inserted last is the first one to be removed.

Recursion is a process in which a function calls itself directly or indirectly in order to solve a problem by breaking it into smaller subproblems of the same type.

Data is the raw material of computation. Every program written in any programming language must deal with data — it must store data, retrieve data, and process data.

The internet is being rebuilt , not with new hardware, not with new protocols, but with a new language. Its name is Rust, and it’s reshaping how we think about performance, security, and the very fabric of modern computing.