## Complete Overview of Tree Data Structure.

A tree structure is a type of hierarchical arrangement utilized for organizing and representing data in a manner conducive to efficient navigation and retrieval. It comprises interconnected nodes establishing hierarchical relationship.

## Queue overview and its implementation with C.

A queue is a linear data structure in computer science that represents an ordered collection of elements or items. In a queue, elements are added at one end, known as the “rear” or “back” of the queue, and removed from the other end, known as the “front” or “head” of the queue.

## Stack Overview and implementation with C.

A stack is a collection of items arranged in a specific order, where new items can be added or removed
only from one end, known as the top of the stack. The stack is dynamic, meaning it can change
constantly.

## Recursion implementation on Tower of Hanoi.

Recursion is a problem-solving technique where the solution of a problem depends on solutions to smaller instances of the same problem. It is a process by which a function calls itself directly or indirectly. Such a function is called a recursive function.

## Brief Overview of Algorithm Analysis.

“An algorithm is a finite set of precise instructions executed in finite time for performing a computation or for solving a problem”. To represent an algorithm we use pseudo-code. Pseudo-code represents an algorithm in a clear understandable manner in like English language and gives the implementation view as like programming
language.