Returns true if key presents in trie, else false

Function to print nodes in a given linked list */

Function to Display Nodes of a Linked List */

DISPLAY LIST

function to swap elements

A utility function to swap two elements

Function to invert a given binary tree using preorder traversal

Function for Swapping */

Function to swap elements A[i] and A[j] in an array

another function we are calling

BFS traversal is similar to the Level Order Traversal. We will travel the tree row wise i.e. first row then second and so on. So first, we will push r

Function for the implementation of Bellman Ford Algorithm */

This is a function to run the Bellman Ford algorithm

This function checks if given binary tree is symmetrical

Method to implement Dijsktra -Shortest path algorithm */

Function to print the final distance Array */

dist[][] will be the output matrix that will finally have the shortest distances between every pair of vertices

function to check whether the string is good or bad

Function for Inserting Nodes in a Tree */

inserting key

to sort the individual bucket

Function to find the maximum profit and the number of jobs done.

Prints occurrences of text[] in pattern[]

Return the Kth smallest element in the given BST

Morris Inorder Traversal */

Function to get the nth ugly number */

function to heapify the heap by restoring node down

function to heapify the heap by restoring node up