Returns maximum value in a given Binary Tree

function to maximize the sum of selected numbers

m is the given matrix and n is the order of matrix MAX is the upper limit of N ie 5

Merges two subarrays of arr[]. First subarray is arr[l..m] Second subarray is arr[m+1..r]

Function to merge k sorted arrays.

Function to merge K sorted linked list.

FUNCTION TO MERGE TWO LISTS

A utility function to find the vertex with minimum distance value, from the set of vertices not yet included in shortest path tree

A utility function to find the vertex with minimum distance value, from the set of vertices not yet included in shortest path tree

Returns minimum number of jumps to reach arr[n-1] from arr[0]

Function to find out minimum steps Knight needs to reach target position.

Function to find minimum swaps to group all 1's together

Function to find the minimum number of swaps required to sort the array.

Returns minimum value in a given Binary Tree

Program has predefined number of vertices as 5 and Infinity as 99 */ Method to find the vertex with minimum distance */

Complete the miniMaxSum function below.

To multiply contents of two linked lists

Function to create a new node with given data.

Helper function that allocates a new node with the given data and NULL left and right pointers. */

Function to find the number of islands.

Function to find minimum time required to rot all oranges.

Function to find pair whose sum equal to given value x.

Function to pairwise swap elements of a linked list */

This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivo