Week 13 Assignment SDEV-350 Java Programming II © Champlain College Assignment This week, we will modify the BST Animation program to display both a Binary Tree and its balanced AVL Tree. Requirements...

JavaFx 8 AVL tree, see attached pdf for more information


Week 13 Assignment SDEV-350 Java Programming II © Champlain College Assignment This week, we will modify the BST Animation program to display both a Binary Tree and its balanced AVL Tree. Requirements  Your GUI may not appear exactly as the sample above. However, it should have all of the components/nodes shown  Modify the BSTAVLAnimation.java file available for download on the Week 13 Assignment page  Add the following functionality: o Two views, one for the BST Tree on the left and one for the AVL Tree on the right o A Balance button o A Clear button o An Exit button  The BST area will display the nodes (keys) as they are entered (Insert button clicked - see below)  Once the BST is built, the Balance button will render an AVL version of the BST Tree in the AVL area  The Insert button: o Inserts a value entered in the “Enter a key” TextArea and displays in the BST view only  The Delete button: o Deletes a value entered in the “Enter a key” TextArea o Updates both trees (if both are visible)  The Balance button: o Takes the nodes that were inserted into the BST Tree and renders an AVL Tree in the AVL Tree view  The Clear button: o Clears both view areas, the Binary Tree and AVL Tree nodes and any other ArraysLists (hint), or other storage mediums employed during the process o Sets the view messages as seen below (See screen shots)  The Exit button closes the program JavaFX AVL Trees Week 13 Assignment SDEV-350 Java Programming II © Champlain College  Your code should include: o The downloaded BSTAVLAnimation.java program o The AVLTree Class (Listing 26.3: This is similar to the BST class. You might want to rename it AVL for consistency) o An AVLView class which will be similar to the BSTView included in the download o Any other subclass that you may wish to implement o Rename the BST_AVL_Animation main class in the download to the standard naming convention _Week13  Validation/Exception handling where appropriate  Change the color of the node circles – your choice of colors  This assignment covers subjects from Chapter 1 - 26 Hints Sample code is readily available in this week’s lecture material as well as the text book and Internet. If you find code on the Internet that you believe might assist, make sure you give proper credit to the source. Make sure that you utilize the most efficient algorithm that you can. This program should be based off of the downloaded program and Listing 26.3 in the text book. Expected Output You have creative freedom with this assignment. Your result is not required to appear exactly as the sample above or screen shots below. However; it must contain all of the same components and include the functionality described above and below in the screen shot examples. Your GUI must also be visually appealing with consistent spacing/gapping. When adding large trees, your nodes may float outside of the border areas. This is acceptable. Deliverables Please zip your program and submit the zip file by the due date listed in the requirements. Screen Shot: After inserting an off balanced BST Tree in this order: (7, 9, 11, 15, 17, 2) Week 13 Assignment SDEV-350 Java Programming II © Champlain College After clicking on the Balance Button (notice the changes) After 3 was inserted and the Balance Button clicked again (notice the changes) After the Clear Button was clicked