- Returns the initial found index position of the target value if flag is set to 0 (Default) - Returns Starting Positon of the target v

* time complexity O(n*n) - space complexity O(1)

-------------------------------------------------------------

function to print the value of youngest member for given numbers

function to print Binary Search Tree

Function to insert element in the hash table

Inputs- arr: A sorted array in which we're going to search for the key x: The number to be searched for n: Size of the array

Find takes a slice and looks for an element in it. If found it will return true otherwise it will return false.

Utility Function to Generate Ancestors of the node

Function to get weight of an operator. An operator with higher weight will have higher precedence.

Function to calculate height of a given Tree recursively

To limit parameters

--------------------------------------------------------------

Returns the sorted run in place using binary search to find the index where the element can be inserted.

Function that returns tree-node after left-left rotation*/

Function to Delete an element from Hashtable.

Function that returns tree-node after left-right rotation*/

Function to insert element in HashTable.

function for merging element

Utility Function to print given path

Displays all content of queue

Function to insert in hashtable.

Function that returns tree-node after right-left rotation*/

Function that returns tree-node after right-right rotation*/

Utility function to find distance between a node and its ancestor

Splits a given matrix

Call Modified DFS and perform topological sorting

Searches if a word is present in the Trie. Basically a private function that can be used to query or delete results

Function which returns true if element found in an array, else returns false.

Displaying output

Validation

-------------------------------------------------------------------------------

function to sort the given char arr[] in alphabetical order

Function to create linked list

createAtFront: create a node at the front of the list with the value the passed in int

Function to build tree with given input

Function to build tree with given input

This function is responsible to creating digraphs of the input plaintext. The entire string is split into pairs of two characters. In case a

This function is used to generate a 5 x 5 matrix of the english alphabets using the key provided. This key matrix is used for encrypting/decr

Dequeue i.e delete at the FRONT end

<p> This is a public method used to decrypt cipher using integer key using Rail Fence Cipher algorithm. </p> <b>Process</b> <ul> <li>As in Rail Fence

Method to delete an item from the heap NOTE: That the element is always deleted from the top of a heap as it gives the maximum element