* @brief Range query in segment tree. Essentially performs the `combine_` function * on the range `array[l, r]` (bounds are inclusive)

Utility function to find minimum of three numbers */

helper function to get maximum of two integers

* Bag::remove * This function removes a random item from the bag and returns which item was * removed from the bag *********************

A utility function to swap to integers

<p> Checks if the element is a member of the bloom filter. T:: O(k); where k is the number of hash functions @param element The element th

---------------------------GETTERS-----------------------------------------*/

Establish a connection of given weight

* Bag::isEmpty * This function returns true if the bag is empty and returns false if the * bag is not empty ***************************

! \brief Increase the storage capacity of the array to a value * that’s is greater or equal to 'new_cap'. * \param new_cap New capacity. *

Insert the given value in the tree. The tree is traveled until an empty sub-tree is found: If the value is lesser than the one hold by the current no

adds edge between u and v of weight w

helper function to return height of a node

<p> Adds the element into the bloom filter. To get added, it must pass through the k hash functions of the bloom filter. T:: O(k); where k is the num

Inserts New data at the ending of the Linked List Takes O(n) time