constructs the HumpingDumping object with given input array. @param data

constructs a new Josephus object to execute with the initial number of people. @param N number of people as <code>int</code>.

creates a new empty <code>LinkedList</code> object.

creates a percolation object of N x N grid and initialize internal state of different parts. @param N Number of rows in a square grid as integer.

creates a new empty Queue object.

constructs the object.

constructs a QuickUF object for given number of items. @param N number of items in the set as positive integer.

constructs the RandomizedQueue object.

constructs a new Stack Object.

constructs the queue object.

constructs a RingBuffer object with fixed capacity. @param N capacity of buffer as <code>int</code>

creates a new symbol table object

Constructs a Stack object.

constructs a steque object.

constructs a UF object for N items. @param N number of items in positive integer.

creates an empty unordered symbol table data structure object.

Constructs the object @param N size of the Union-find as int.

add item to the last of the list

calculates the average degree of a graph by averaging the degree of each vertex in the graph. @return average as <code>double</code>.

checks to see if the given key is present in symbol table. @param key @return

checks if the given key is present in BST. @param key @return <code>true</code> if key is available, <code>false</code> otherwise.

returns the number of vertices connected in the graph. if the count is equal to total number of vertices of the graph, then the complete graph is conn

deletes the character from the cursor position. @throws NoSuchElementException if buffer is empty. @return character at cursor position.

deletes the middle element of the stack and re-adjust the middle after it. @return

removes the string from the queue. @return

removes an element from the queue from the front. @return a String element from the queue.

removes the element from the queue. @return an element of type String.

inserts a string item into the queue. @param item

inserts an item into the queue at the end. @param item a String element added to the queue.

adds a String element in the queue at the end. @param s an element of String type

checks to see if given two objects by their id are connected. @param p first object id as int. @param q second object id as int. @return <code>true</c

peeks the middle element of the stack without deleting it from the stack. @return element as Item.

returns the item at the specified index

returns the size of CircularLinkedList

checks to see if there is an edge v-w in the graph. @param v one vertex @param w other vertex @return

inserts the given character at the cursor position in the buffer. @param c Character to be inserted.

checks to see if the site at location (i, j) is a full site. @param i row index of the grid @param j column index of the grid @return <code>true</code

returns an iterator over the elements of the queue.

returns an iterator over the elements in the deque from front to end fashion.

returns an iterator over the elements stored in steque.

returns an iterator to list

returns an iterator over the stack data structure.

moves the cursor to the left by given position. @param k the number of position to the left.

checks if the given vertex is marked. This will help in answering questions like, is there any path between given vertex and source vertex? @param ve

opens the site at location (i, j) if not opened already. @param i row position in the grid @param j column position in the grid

returns the path between source vertex and given vertex as an Iterable set. @param v @return

checks to see if there is a connected site from top row of the grid to the bottom row. @return <code>true</code> if it percolates, <code>false

pops an item from the stack if available. returns an item if present, null otherwise. @return