inserts a key-value pair into the tree, if not already exists. In case if Key is found, then its corresponding value is replaced. if Value is <code>nu

connects two object represented by their ids in one connected component set. @param p first object id as int. @param q second object id as int.

gets the total number of vertices in the graph. @return

returns the current size of the tree. The size of a tree T is the number of nodes in the tree, rooted at node T. @return

adds the currently performed action code in the checkpoint list. when an action is performed, the last undo action list is discarded. @param checkpoin

append specified item to the end of this list @param item specifies the item to be added

inserts an item into the buffer if there is an empty location. @param data item to be inserted as <code>String</code>

inserts an item into the stack. @param item An item to be added onto the stack.

adds an item into the bag. @param item An item need to be added.

retrieves the value corresponding to a given key in the symbol table. @param key @return

checks to see if deque is empty. @return <code>true</code> if no elements present, <code>false</code> otherwise.

removes the last item inserted in the stack. @return an item inserted recently.

returns the number of elements in the deque. @return the size as int.

connects two objects given by its arguments. @param p id for the first object. @param q id for the second object.

adds an item at the end of the deque. @param item item to be added at the end of the deque.

adds an element at the front of the queue. @param item element to be inserted, should be not null.

returns a list of adjacent vertices of a given vertex in the graph. @param v the vertex whose adjacency list is required. @return

compares the two integers a and b @param a Integer at first position @param b Integer at second position @return <code>0</code> when a and b are equal

checks if the checkpoint object is empty. @return <code>true</code> if is empty, <code>false</code> otherwise.

Inserts a new data item in the symbol table, corresponding to the given <code>Key</code>. If <code>key</code> is already present, then its <code>value

gets the current size of checkpoint object. It is the sum of current operations and undo operations recorded. @return size as <code>int</code>

return the actual size of buffer filled with items. @return size of buffer as <code>int</code>.

connects two given objects by their id. @param p first object id as int. @param q second object id as int.

removes the least recent item from buffer. @return item as <code>String</code>

gets the corresponding value for a given key. if key is not found then <code>null</code> is returned. @param key @return

removes an item from the front of the deque. @return an item at the front of the deque.

gets the degree of a given vertex v in the graph G. A degree is the number of edges incident from vertex v. @param vertex vertex id as zer

returns the identical numbers found in both the sorted array of N integers in running time of T(N) ~ N for worst case.

rearranges the array in ascending order, using the natural order. @param array the array to be sorted

returns the maximum depth of an expression given as <code>String</code>. If the expression is not balanced then returns <code>-1</code>. @param expre

inserts an item in the steque in stack fashion. @param item Item to be inserted.

returns the size of the queue. @return size as Integer.

return the number of elements currently in the steque. @return size as integer.

returns the current size of ST. @return

removes a randomly chosen item from the queue. If queue is empty, throws NoSuchElementException. @return a randomly chosen item from queue.

inserts an item into the queue. @param item Item to be inserted in the queue.

inserts the given item into the queue. @param item Item to be stored.

inserts an item in the steque in queue fashion. @param item Item to be inserted.

checks to see if there is a connection between given two object ids. @param p first object id @param q second object id @return true if connected, fal

finds if connection exists between given two objects. @param p first object as int @param q second object as int @return <code>true</code> if connecte

searches the given <code>key</code> in the symbol table to retrieve the corresponding <code>value</code>. @param key @return <code>value</code> if key

checks to see if there is a path between source vertex and given vertex v. @param v @return

checks to see if queue is empty. @return <code>true</code> if empty, <code>false</code> otherwise.

checks to see if the tree is empty. @return <code>true</code> if tree is empty, <code>false</code> otherwise.

checks to see if buffer is full. @return <code>true</code> if full, <code>false</code> otherwise.

checks to see if the site at location (i, j) is opened. @param i row position in the grid @param j column position in the grid @return <code>true</cod

pops a least recent item in steque. @return Item object from steque.

returns the top item of the stack and remove it. @return most recent item inserted in the stack.

pops the most recently pushed item from the stack. @return the item from Stack as <code>String</code>.

removes an item at the end of the deque. @return item from the end.

return the number of item in list @return the size of list as integer

returns the current occuppied size of the stack. @return the size as <code>int</code>.

rearranges the array in ascending order, using the natural order. @param array the array to be sorted

rearranges the array in ascending order, using the natural order. @param array the array to be sorted

undo the last performed operation/checkpoint. @return operation code of last action.

returns the ceiling of a given key in the tree. The key may/may not be present in the tree. A ceiling of a key is defined as the smallest element whic

checks if the given key is present in the symbol table. @param key key to be searched. @return <code>true</code> if found, <code>false</code> ot

returns the floor of a given key in the tree. A floor of a key is defined as the largest element which is smaller than or equal to the given key. @par

checks to see if queue is empty. @return <code>true</code> if queue is empty, <code>false</code> otherwise.

checks to see if steque is empty. @return true if steque is empty, false otherwise.

checks to see if symbol table is empty. @return

checks to see if stack is empty. @return true if stack is empty, false otherwise.

checks to see if the stack is empty @return <code>true</code> if empty, <code>false</code> otherwise.

checks to see if stack is empty. @return true if stack is empty, false otherwise.

returns an iterator over the LinkedList.

removes the last item inserted in the stack. @return an item inserted recently as String.

pushes a new item onto the stack. @param item a item as String to be added.

pushes a string into the stack. @param item Item to be stored in stack as <code>String</code>.

inserts an item into the stack. @param item A String to be added onto the stack.

returns the size of the stack. @return number of items currently in the stack.

returns the current size of the stack. @return size as <ode>int</code>.

returns the number of elements in the stack. @return the size of stack as integer.

rearranges the array in ascending order, using the natural order. @param array the array to be sorted

rearranges the array in ascending order, using the natural order. @param array the array to be sorted

adds an edge v-w in the graph. @param v one vertex @param w other vertex

deletes the node with minimum key from the BST.

returns the item at specified position in the list @param index specifies the position from the list in integer @return item in the list @throws Index

checks to see if the queue is empty. @return true if queue is empty, false otherwise.

checks to see if buffer is empty. @return <code>true</code> if empty, <code>false</code> otherwise.

checks to see if list is empty. @return <code>true<code> if list is empty, <code>false</code> otherwise.

checks to see if Bag is empty. @return <code>true</code> if empty, <code>false</code> otherwise.

checks to see if stack is empty. @return true if stack is empty, false otherwise.