push expensive

pop easy

RETURNS TRUE IF BOTH STACKS ARE EMPTY

Inserting Node

function to get maximum of two integers

If find does not make sense then you need to watch DSU videos

function to get the height of the tree

================================================== DSU FIND FUNCTION (path compression) ===================================================*/

Function to swap two numbers.

Function to insert a node in doubly linked list

Utility function to get max of 2 integers

function to get balance factor

function to left rotate subtree

function to right rotate subtree

* @brief add_node function are create new node * * @param data * @return struct Node* */

Helper function that allocates a new node with the given data and NULL left and right pointers. */

Given a reference (pointer to pointer) to the head of a list and an int, push a new node on the front of the list.

function that reverses the given stack

epsilon be the error in determing roots of a function take an example of a function whose solution we have to find Let function be: x^3 - x^2 + 2

SIMPLY PUSH THE ELEMENT IN STACK1

utility function to insert node in the list

------------This function displys the contents of stack 1---------------------------------*/

------------This function displays the contents of stack 2--------------------------------*/

T is the template argument that accepts different data types

A utility function to get the middle index from corner indexes.

function to access protected member from Base

Function to reverse the linked list

prints deque if it is not empty

Insertion Values into BST

Provides the node whenever new node encounters.

-------------Recursive method for the calculation of GCD----------------------------*/

To find the parent of a given index recursively

function to access private member

Return sum of elements in range from index qs (query start) to qe (query end). It mainly uses getSumUtil()

data members of base class created

To heapify a subtree rooted with node i which is an index in arr[]. n is size of heap

To heapify a subtree rooted with node i which is an index of arr[] and n is the size of heap

--------------------------A function for allocating new tree node-----------------------*/

------------------------A pop function for remoing nodes from the stack-----------------*/

function to print preorder traversal of the tree.

to comparare the precedence of operaters

to comparare the precedence of operaters

Print buckets

print list

Function to print the linked list

* Printing the array * Input: array to be printed, size of the array */

method to print the array

Function to print nodes in a given doubly linked list This function is same as printList() of singly linked list */

--------------------------A push function for nodes into the stack---------------------*/

Function to Insert values to Linked List

the query function

Returns true if key presents else false

For Printing onto Screen

======================================================== BORUVKA'S ALGORITHM MAIN FUNCTION ===============================================

function BST of type class bst

Sorting function