You need to finish the implementation of swapNodes(int firstValue, int secondValue), isValid(), fixTree().swapNodes will take two values, you will find the two nodes that contain these values and swap...

You need to finish the implementation of swapNodes(int firstValue, int secondValue), isValid(), fixTree().

swapNodes will take two values, you will find the two nodes that contain these values and swap them.

isValid will check if the tree is a valid BST and follows the rules

fixTree will find the nodes that aren't correct and swap them back

Turn in the fully implemented version of theBinarySearchTree.javafile, no need to submit the entire zip file, you will not be changing anything in the other files.