Function to implement the Fenwick Tree */

Function to implement the Fenwick Tree */

to sort-inorder traversal gives sorted list

Function to find Inorder

In-Order traversal Left Subtree -> Node -> Right Subtree

Building the trie

If not present, inserts key into trie If the key is prefix of trie node, just marks leaf node

insert the key to the tree in its appropriate position and fix the tree

to insert a node into BST

Inserting element in beginning

Inserting Node at last

Insertion of node at a given position

Function to sort an array using insertion sort*/

Function to sort an array a[] of size 'n'

sorting using insertion sort

If the searching element is present it will return its index, else it will return -1.

If x is present in arr[0..n-1], then returns index of it, else returns -1.

Function to find intersection point in Y shaped Linked Lists.

Function to find if the given edge is a bridge in graph.

Function to detect cycle in an undirected graph.

Queue is full when size becomes equal to the capacity

Function to check a number is lucky or not

A utility function to check if str is palindrome

Function to check if given linked list is palindrome or not

Checks whether it will be legal to assign num to the given row, col

A utility function to check if a queen can be placed on board[row][col]. Note that this function is called when "col" queens are already placed in col

Function to check if a number is ugly or not

Function to check if a number is ugly or not */