binary trees system out println("found the node with key ")else system out println("could not find node with key ")/end main(/end class treeapp tip in listing the main(routine also provides primitive user interface so you can decide from the keyboard whether you want to insertfinddeleteor perform other operations next we'll look at individual tree operationsfinding nodeinserting nodetraversing the treeand deleting node finding node finding node with specific key is the simplest of the major tree operationsso let' start with that remember that the nodes in binary search tree correspond to objects containing information they could be person objectswith an employee number as the key and also perhaps nameaddresstelephone numbersalaryand other fields or they could represent car partswith part number as the key value and fields for quantity on handpriceand so on howeverthe only characteristics of each node that we can see in the workshop applet are number and color node is created with these two characteristicsand keeps them throughout its life using the workshop applet to find node look at the workshop appletand pick nodepreferably one near the bottom of the tree (as far from the root as possiblethe number shown in this node is its key value we're going to demonstrate how the workshop applet finds the nodegiven the key value for purposes of this discussion we'll assume you've decided to find the node representing the item with key value as shown in figure of coursewhen you run the workshop appletyou'll get different tree and will need to pick different key value click the find button the prompt will ask for the value of the node to find enter (or whatever the number is on the node you choseclick find twice more