A tree is a connected graph without cycles. The maximum number of edges in a tree with n nodes is n-1, as adding one more edge would create a cycle.

Merge Sort has the best worst-case time complexity of O(n log n), which is optimal for comparison-based sorting algorithms.

Hash tables use a key-value pair to store data, allowing for constant-time lookup and insertion, making them the most efficient data structure for checking if an element is present.

Dijkstra's Algorithm is used to find the shortest path between two nodes in a weighted graph, where the weights represent the distances between nodes.

Linear search involves checking each element of the array sequentially, resulting in a time complexity of O(n).

Prim's Algorithm is a greedy algorithm used to find a minimum spanning tree in a weighted graph, where the goal is to find a subset of edges that connects all vertices with the minimum total weight.

Backtracking is an algorithm used to find all possible subsets of a set by systematically exploring all possible combinations.

The Knapsack Problem is a classic dynamic programming problem where the goal is to find the maximum value of items that can be placed in a knapsack with a given capacity.

The Ford-Fulkerson Algorithm is used to find the maximum flow in a network, which represents the maximum amount of flow that can be sent from a source node to a sink node.

Monte Carlo Simulation is a non-deterministic algorithm that uses random sampling to obtain approximate solutions to problems.

Graham's Scan is an algorithm used to find the convex hull of a set of points, which is the smallest convex polygon that contains all the points.

Merge Sort is a divide-and-conquer algorithm that recursively divides the input array into smaller subarrays, sorts them, and then merges them back together.

Prim's Algorithm is used to find the minimum spanning tree in a weighted graph, which is a subset of edges that connects all vertices with the minimum total weight.

Bubble Sort is a simple sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order.

Breadth-First Search is used to find the shortest path between two nodes in an unweighted graph by exploring all nodes at the same level before moving to the next level.