one option is to simply forbid duplicate keys when duplicate keys are excluded by the nature of the data (employee id numbersfor example)there' no problem otherwiseyou need to modify the insert(routine to check for equality during the insertion processand abort the insertion if duplicate is found the fill routine in the workshop applet excludes duplicates when generating the random keys the complete tree java program in this section we'll show the complete program that includes all the methods and code fragments we've looked at so far in this it also features primitive user interface this allows the user to choose an operation (findinginsertingdeletingtraversingand displaying the treeby entering characters the display routine uses character output to generate picture of the tree figure shows the display generated by the program figure output of the tree java program in the figurethe user has typed to display the treethen typed and to insert node with that valueand then again to display the tree with the additional node the appears in the lower display the available commands are the characters sifdand tfor showinsertfinddeleteand traverse the ifand options ask for the key value of the node to be operated on the option gives you choice of traversals for preorder for inorderand for postorder the key values are then displayed in that order