Repository for NAU course CS305, for assignment module 5. Created by student user crh489.
Be able to analyze any of the following methods, including tracing operations given some data Be able to write parts or all of any of the following methods Be able to trace a BFS or DFS through a given graph
public LL_IteratorClass()public LL_IteratorClass( LL_IteratorClass copied )
public void displayIterator()
public NodeClass getCurrentPriorRef()
public int getValueAtCurrent()
public boolean hasNext()
public boolean hasPrev()
public void insertAtCurrent( int newVal )
public void insertAtEnd( int newVal )
public void insertAtFront( int newVal )
public boolean moveNext()
public boolean movePrev()
public int removeAtCurrent()
public boolean setToFirst()
public boolean setToLast() public BST_Class()
public BST_Class( BST_Class copied )
private StudentClassNode copyConstHelper( StudentClassNode copiedRef )
public void insert( StudentClassNode inData )
private void insertHelper( StudentClassNode localRoot, StudentClassNode inData )
public String outputInOrder()
private void outputInOrderHelper( StudentClassNode localRoot )
public String outputPostOrder()
private void outputPostOrderHelper( StudentClassNode localRoot )
public String outputPreOrder()
private void outputPreOrderHelper( StudentClassNode localRoot )
private StudentClassNode removeFromMax( StudentClassNode parent, StudentClassNode child )
public StudentClassNode removeNode( StudentClassNode inData )
private StudentClassNode removeNodeHelper( StudentClassNode localRoot, StudentClassNode outData )
public StudentClassNode search( StudentClassNode searchData )
private StudentClassNode searchHelper( StudentClassNode localRoot, StudentClassNode searchData ) public TwoThreeTreeClass()
public TwoThreeTreeClass( TwoThreeTreeClass copied )
private TwoThreeNodeClass copyConstructorHelper( TwoThreeNodeClass workingCopiedRef )
private void addAndOrganizeData( TwoThreeNodeClass localRef, String itemStr )
public void addItem( String itemStr )
private void addItemHelper( TwoThreeNodeClass localRef, String itemStr )
public void clear()
public int compareStrings( String leftStr, String rightStr )
private void fixUpInsert( TwoThreeNodeClass localRef )
private boolean foundInNode( TwoThreeNodeClass localRef, String searchStr )
public String inOrderTraversal()
private void inOrderTraversalHelper( TwoThreeNodeClass localRef )
public boolean search( String searchStr )
private boolean searchHelper( TwoThreeNodeClass localRef, String searchStr ) public OpCodeHeapClass()
public OpCodeHeapClass( OpCodeHeapClass copied )
public void addItem( OpCodeClass newItem )
private void bubbleUpArrayHeap( int currentIndex )
private void checkForResize()
public boolean isEmpty()
public OpCodeClass removeItem()
public void setDisplayFlag( boolean setState )
public void showArray()
private void trickleDownArrayHeap( int currentIndex ) public BST_HashClass()
public BST_HashClass( int inTableSize )
public BST_HashClass( BST_HashClass copied )
public void addItem( String inName, int inStudentID, char inGender, double inGPA )
public void addItem( StudentClassNode newItem )
public void clearHashTable()
public StudentClassNode findItem( int studentID )
public int generateHash( StudentClassNode studentData )
public StudentClassNode removeItem( int studentID )
public void showHashTableStatus()
Mobile application for sharing recipies