apple-pascal-1.3-manual

If you wish to modify, compile, and execute a new version of ademonstration program, the following diskfiles will be needed:xxxxxx. TEXTSYSTEM.EDITORSYSTEM.COMPILERSYSTEM.SYNTAXSYSTEM.PASCALSYSTEM.LIBRARYSYSTEM.CHARS ET(any disk, any drive; required only until read intoEditor)(any disk, any drive)(any disk, any drive)(same disk as Editor, any drive; optional Compilererror messages)(system disk, startup drive)(system disk, startup drive)(any disk, #4: or #5: ; required if WCHAR orWSTRING used)The Tree ProgramTREE shows the creation of an unbalanced binary tree to sort and retrievedata elements (words, in this case). It lets you specify each new word to bestored in the tree, and then shows you graphically just where the new wordwas placed in the tree.When you execute TREE.CODE, you are prompted toENTER WORD:To quit the program at any time, you can just press RETURN in response tothis message. To continue, you should type the first word to be sorted (onlythe first six characters are used). For example, you might typeFLIPPVThe program then lists the words entered so far, in alphabetical order.THE WORDSFLIPPYIN ORDER ARE:No prompt appears, but you must press RETURN to proceed. When you do,a picture is displayed, showing the binary tree as it now exists.I1--------1I FLIPPY I1--------1I\\Other Demonstration Programs 11-305