insertion of the node

insertion of the node

function to check if queue is empty

right rotation can be illustrated as follows: (critical_node) (next_node) / (right r

Function to find root of a certain component for union find algorithm

To place the element at idx to its right position

Factorial function. This will be used in the power series

Let's take an example function f(x) = x^2 - 10*x - 20

Print all the nodes of list

Inorder Function

function to add the element in linked list

Postorder Function

Preorder Function

calculate function is used to calculate a value given two operandsand one operator

To find nth catalan number using recursive function

Iteratively finds the result of the expression (base**exp) mod n

optimised find function

This function returns the row index and column index of an element in the matrix. :param elem: element whose position is to be searched

To insert word in Trie

@param b @return a new Complex object whose value is (this b)

Returns the top of the temporary stack

to delete from stack

pop function of stack

In Expression containing only '*','/','+' and '-' '*' and '/' have the highest precedence followed by '+' and '-'

Level order traversal of heap

push operation for the stack

to push into stack

push operation for the stack

push function of stack

@return a new Complex object whose value is the complex sine of this

@brief function to swap two characters */

Function to create a new node with desired value and return its address

Function to return maximum value of root key of the given tree