Constructs and returns a Binary Indexed Tree for given array of size n.

utility function to convert the given BST to MIN HEAP

Faster method, iterates exactly s times, where s is the number of bits set

Returns count of all possible parenthesizations that lead to result true for a boolean expression with symbols like true and false and operators like

To create a node */

creating the single linked list

function to create a queue of given capacity. It initializes size of queue as 0

checking if v1 and v2 are already connected

Sort a vector in place and return the number of writes.

Function to delete before a specific data node

Function to insert before a specific data node

A function to declare the winner of the game

A C function to declare the winner of the game

+============================================================================= Convert the pronto string in to data

* Delete Element from the tree */

Function to remove an item from queue. It changes front and size

Function that implements Dijkstra's single source shortest path algorithm for a graph represented using adjacency matrix representation

Function to neatly display the list