function to get a warmer temperature.

delete the node from the tree

Function to delete a node without any reference to head pointer.

Function to delete an element from front */

Delete element at a given position

Function to delete an element from rear */

Function for deleting middle of the stack

Function to remove an item from queue. It changes front and size

Function to check if the linked list has a loop. This is the solution using the two pointer algorithm.

this dfs function will visit the nodes

function created to find the entry and exit time each vertex and store it in vertex time_in and time_out

Recursive functin to calculate the diameter of the tree

Function that gives sum of digits of numbers

Function to find the shortest path from source * using Dijkstra's algorithm * source: the source vertex * V: number of vertices * e: number of edg

Function that implements Dijkstra's single source shortest path algorithm for a graph represented using adjacency matrix representation

Function that implements Dijkstra's single source shortest path algorithm for a graph represented using adjacency matrix representation

Display Elements of linked list

Function to insert an element to the front */

Function to insert an element to the rear */

calculate eucledian distance between point and (0, 0)

calculating the diameter of the binary tree.