Function to construct segment tree from given array. This function allocates memory for segment tree and calls constructSTUtil() to fill the allocat

printing circular linked list

Calculating Factorial recursive approach

To delete the linked list.

A utility function to get the middle index from corner indexes.

Returns new trie node (initialized to NULLs)

Return sum of elements in range from index qs (quey start) to qe (query end). It mainly uses getSumUtil()

Function to get sum of all numbers in the array */

Function to get sum of all numbers in the array */

To heapify a subtree rooted with node i which is an index in arr[]. n is size of heap

Recusive function to calculate the height of the tree

INORDER TRAVERSAL WITH RECURSION */

function which returns true if particular element is Perfect number */

Function that checks number is prime or not

function merge BST in sorted order

A utility function to find minimum of two float values

:type str: str :rtype: int

Function to merge the arrays.

function to pop-up top of stack

Function to pop an element from stack */

UTILITY FUNCTIONS Function to print an array

Utility function to print an array */

Function to print the nodes of the linked list

push function adds(pushes) element on top of stack

To insert a node in the linked list.

function to heapify (or restore the max- heap property). This is used to build a k-ary heap and in extractMin() att[] -- Array that stores heap

Function to reverse the linked list Note that this function may change the head