----------------This function creates new stack--------------------------*/

Creating tree from level order input

function to create genric tree (n)

utility function to detect cycle

function to delete a node with given key from subtree with given root.

Function to delete the root from Heap

deletes element from the front if the deque is not empty

deletes element from the end if the deque is not empty

the function diameter basically calculate the diameter and update it if required but return the height. And as a parameter, a Node is passed.

display huffman coding

function to display the 2-d array

----------------This function prints all the element sof the Stack----------*/

function to display the genric tree (n)

Function to find peak of the array

Checking if the stack is empty

----------------This function checks whether the stack is empty-------------*/

Function to calculate nth fibonacci number

Function to find Ceil value

initiate the search on path/cycle

LCS based function to find minimum number of insertions

Find pairs with given sum key

Applying fordfulkerson algorithm

Recursion function

Recursive function

Recursive function

A utility function to get maximum value in arr[]

function to access private member

A recursive function to get the sum of values in the given range of the array. The following are parameters for this function. st --> Poin

performing heap Sort

Compute the "height" of a tree -- the number of nodes along the longest path from the root node down to the farthest leaf node.*/

------------Height of the binary tree------------///

building a huffman tree

---------------------Main Function--------------------------/// InOrder Traversal of Binary Tree - Similar to Depth First Search

To Print BST

Initializing the Stack

-------------------A function for inorder traversal of the tree-------------------------*/

TIME COMPLEXITY BEST CASE TIME COMPLEXITY FOR INSERTION IS O(1) as the element to be inserted is at last index. So the element is directly inserted WO

function that inserts an element into stack.

function to insert a key in node

Function to insert a new node to the Heap

inserts element at the front if the deque is not full

inserts element at the rear if the deque is not full

function to check if cows can be allocated for the given minimum distance betwen two cows

----------------------A function to check the character is operator or not --------------*/

Function will check weather the list is palindrome or not

Function to test whether a string is palindrome or not */

main function which will return thr result in boolean format

Returns length of LCS for X[0..m - 1], Y[0..n - 1]

LCS function to find the length of longest common subsequence in two strings str1 and str2

Returns length of LCS for X[0..m-1], Y[0..n-1].

------------Number of leaf nodes in the binary tree------------//