Function to answer queries in logN time,what we are doing here is we are traversing the whole tree and we are going to it's their child then if curren

oldest entered element is always at the top of stack 1

deQueue operation just pops from stack1

This function identifies the maximum value of AND operation by making cosideration of missing values in higher order n

This function checks if a string is a palindrome by comparing a string with it's reverse

check if its empty list or not

Find sum of digits of a number

this function ciphers a string using the caesar's cipher method string: the message to cipher key: the number of times to shift the lette

/

Function to find wether a node exists in a tree or not.

/

Reversing the second half of the linked list

Function that returns number of nodes in the connected component having vertex u

This function checks if pair of bracket are matching or not

method to find the next lexicographical greater string @param w @return a new string

Build tree :- We are builindg here a Tree by using an array,we have taken an dp[] array,if dp[i] denotes parent node then dp[2*i] & dp[2*i+1] will giv

Put the tree elements in a list with the inorder traversal approach.

calculateMaxMin is helper function for iterate k subArray that return max - min

function definition

/