arrays check to see whether particular player is presentby searching for the player' number in the structure delete player from the data structure when that player goes home these three operations--insertionsearchingand deletion--will be the fundamental ones in most of the data storage structures we'll study in this book we'll often begin the discussion of particular data structure by demonstrating it with workshop applet this approach will give you feeling for what the structure and its algorithms dobefore we launch into detailed explanation and demonstrate sample code the workshop applet called array shows how an array can be used to implement insertionsearchingand deletion now start up the array workshop appletas described in appendix "running the workshop applets and example programs,with :\>appletviewer array html figure shows the resulting array with elements of which have data items in them you can think of these items as representing your baseball players imagine that each player has been issued team shirt with the player' number on the back to make things visually interestingthe shirts come in variety of colors you can see each player' number and shirt color in the array figure the array workshop applet