+============================================================================= Check for a valid "blank" ... '\0' is a valid "blank"

A utility function to left rotate subtree rooted with x See the diagram given above.

Moves a piece and switches current_player

This function multiplies x with the number represented by res[]. res_size is size of res[] or number of digits in the number represented by res[]. Thi

Returns optimal value possible that a player can collect from an array of coins of size n. Note than n must be even

Returns maximum number of thieves that can be caught.

* @brief Dequeue method for the heap * * @return T : the top (extremum) value */

Finds all possible_moves of current board state

To find the postorder traversal */

To find the preorder traversal */

A utility function to print array of size n */

* @brief Enqueue method for the heap * * @param x : the value to insert */

Function to search the appropriate position to insert the new node */

Peek the top (extremum) element of the heap @returns : value of the top element

GetCodebook returns the codebook for this particular tree.

SortFrequencyList generates a list of bytes sorted by relative frequency, starting with the smallest ones.

Finds the top element by traversing (the "linked list") of all root nodes of the trees in the forest @returns : (min_prev, m

Links two nodes in the forest

Merges two trees (binary heaps) in the forest - this happens when we have too many or too few nodes for a single binomial tre

!TBD We need to do this another way!

inserting a node at the beginning of the list