in coding character you typically start at leaf and work upward the tree can be generated by removal and insertion operations on priority queue experiments carrying out these experiments will help to provide insights into the topics covered in the no programming is involved use the binary tree workshop applet to create trees what percentage would you say are seriously unbalanced create uml activity diagram (or flowchartfor you old-timersof the various possibilities when deleting node from binary search tree it should detail the three cases described in the text include the variations for left and right children and special cases like deletion of the root for examplethere are two possibilities for case (left and right childrenboxes at the end of each path should describe how to do the deletion in that situation use the binary tree workshop applet to delete node in every possible situation programming projects writing programs to solve the programming projects helps to solidify your understanding of the material and demonstrates how the concepts are applied (as noted in the introductionqualified instructors may obtain completed solutions to the programming projects on the publisher' web site start with the tree java program (listing and modify it to create binary tree from string of letters (like aband so onentered by the user each letter will be displayed in its own node construct the tree so that all the nodes that contain letters are leaves parent nodes can contain some non-letter symbol like make sure that every parent node has exactly two children don' worry if the tree is unbalanced note that this will not be search treethere' no quick way to find given node you may end up with something like thise