{\rtf1\ansi\deff0\adeflang1025
{\fonttbl{\f0\froman\fprq2\fcharset0 Times New Roman{\*\falt Thorndale};}{\f1\froman\fprq2\fcharset0 Times New Roman{\*\falt Thorndale};}{\f2\fmodern\fprq1\fcharset0 Courier New;}{\f3\froman\fprq2\fcharset0 Times New Roman;}{\f4\fswiss\fprq2\fcharset0 Arial;}{\f5\fnil\fprq2\fcharset0 HG Mincho Light J;}{\f6\fnil\fprq2\fcharset0 Arial Unicode MS;}}
{\colortbl;\red0\green0\blue0;\red0\green0\blue128;\red128\green128\blue128;}
{\stylesheet{\s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\snext1 Default;}
{\s2\sa120\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext2 Text body;}
{\s3\sb240\sa120\keepn\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f4\fs28\lang1033\sbasedon1\snext2 Heading;}
{\s4\sb240\sa60\keepn\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f4\fs28\lang1033\b\sbasedon1\snext1{\*\soutlvl0} Heading 1;}
{\s5\sb240\sa60\keepn\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f4\fs24\lang1033\i\b\sbasedon1\snext1{\*\soutlvl1} Heading 2;}
{\s6\sb240\sa60\keepn\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f4\fs24\lang1033\sbasedon1\snext1{\*\soutlvl2} Heading 3;}
{\s7\sb240\sa60\keepn\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f4\fs24\lang1033\b\sbasedon1\snext1{\*\soutlvl3} Heading 4;}
{\s8\sb240\sa60\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f4\fs22\lang1033\sbasedon1\snext1{\*\soutlvl4} Heading 5;}
{\s9\sb240\sa60\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs22\lang1033\i\sbasedon1\snext1{\*\soutlvl5} Heading 6;}
{\s10\li360\ri0\fi-360\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext10 List;}
{\s11\li720\ri0\fi-360\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext11 List 2;}
{\s12\li1080\ri0\fi-360\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext12 List 3;}
{\s13\cf1{\*\tlswg8236}\tqc\tx4320{\*\tlswg8236}\tqr\tx8640{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext13 Header;}
{\s14\cf1{\*\tlswg8236}\tqc\tx4320{\*\tlswg8236}\tqr\tx8640{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext14 Footer;}
{\s15\sb240\sa60\cf1\qc{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f4\fs32\lang1033\b\sbasedon1\snext16 Title;}
{\s16\sa60\cf1\qc{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f4\fs24\lang1033\sbasedon1\snext2 Subtitle;}
{\s17\li360\ri0\fi1\sa120\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext17 WW-List Continue;}
{\s18\li360\ri0\fi1\sa120\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext18 WW-Body Text 2;}
{\s19\li360\ri0\fi1\sa120\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon18\snext19 WW-Body Text 3;}
{\s20\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon1\snext20 Normal;}
{\s21\li720\ri0\fi0\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\sbasedon20\snext21 Body Text 2;}
{\*\cs23\cf1{\*\updnprop5801}\up10\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\fs24\lang1033\sbasedon27 Footnote Characters;}
{\*\cs24\cf1\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\fs24\lang1033 Page Number;}
{\*\cs25\cf1\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\fs24\lang1033 Numbering Symbols;}
{\*\cs26\cf2\ul\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\fs24\lang1033 Internet Link;}
{\*\cs27\cf1\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\fs24\lang1033 WW-Absatz-Standardschriftart;}
{\*\cs28\cf1\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\lang1033 WW-Absatz-Standardschriftart1;}
{\*\cs29\cf1{\*\updnprop5801}\up10\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\lang1033\sbasedon28 WW-Footnote Symbol;}
{\*\cs30\cf1\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\lang1033 WW-Default Paragraph Font;}
{\*\cs31\cf1\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\lang1033 WW-Page Number;}
{\*\cs32\cf1\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\lang1033\sbasedon30 WW-Page Number1;}
{\*\cs33\cf1\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f0\lang1033\b\sbasedon30 WW-Strong;}
}
{\info{\title 132hw08 - s03}{\author Sharon Tuttle}{\creatim\yr2001\mo1\dy23\hr10\min30}{\operator Sharon Tuttle}{\revtim\yr2003\mo4\dy4\hr23\min27}{\printim\yr2003\mo1\dy28\hr11\min42}{\comment StarWriter}{\vern6410}}\deftab720
{\*\pgdsctbl
{\pgdsc0\pgdscuse195\pgwsxn12240\pghsxn15840\marglsxn1440\margrsxn1440\margtsxn720\margbsxn720\headery0{\*\headeryb283\headerxl0\headerxr0\headeryh0}{\header \pard\plain \s13\cf1{\*\tlswg8236}\tqc\tx4320{\*\tlswg8236}\tqr\tx8640{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\ltrch\loch\fs12 {\ltrch\loch\f3 CIS 132 - HW #7\tab \tab p. {\field{\*\fldinst \\page}{\fldrslt 1}}}
\par {\ltrch\loch\f3 Spring 2003}
\par }
\pgdscnxt0 Default;}}
\paperh15840\paperw12240\margl1440\margr1440\margt720\margb720\sectd\sbknone\pgwsxn12240\pghsxn15840\marglsxn1440\margrsxn1440\margtsxn1303\margbsxn720\headery720{\header \pard\plain \s13\cf1{\*\tlswg8236}\tqc\tx4320{\*\tlswg8236}\tqr\tx8640{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\ltrch\loch\fs12 {\ltrch\loch\f3 CIS 132 - HW #7\tab \tab p. {\field{\*\fldinst \\page}{\fldrslt 1}}}
\par {\ltrch\loch\f3 Spring 2003}
\par }
\ftnbj\ftnstart1\ftnrstcont\ftnnar\aenddoc\aftnrstcont\aftnstart1\aftnnrlc
\pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\qc{\*\tlswg8236}\tx6300\ltrch\loch\fs24\b {\ltrch\loch\f3 HUMBOLDT STATE UNIVERSITY}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\qc\ltrch\loch\fs24\b {\ltrch\loch\f3 CIS 132 - Introduction to Computer Science II - Spring 2003}
\par {\ltrch\loch\f3 Homework #8 - due Friday, April 11th,  4:30 pm}
\par {\ltrch\loch\f3 Binary Trees}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033{\*\tlswg8236}\tx1260\ltrch\loch\fs24\b 
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li360\ri0\fi-360{\*\tlswg8236}\tx6660\ltrch\loch\f3\fs24 {\ltrch\loch\f3 NOTE: This would not be a good homework to leave until the last minute. You have been warned.}
\par 
\par {\ltrch\loch\f3 FIRST: Consider Problems 11.1 and 11.3 on pp. 297-298 of the "Java Structures" text. Note that their answers are in the back of the text. Note, too, that questions such as these would make *dandy* test questions, wouldn't they? Just a thought...}
\par 
\par {\ltrch\loch\f3 NEXT: A linked implementation of a binary tree is contained in files available from the course web page. The test class Cs132BinaryTreeTest has methods which happen to demonstrate how a binary tree can be started up and initialized.}
\par 
\par {\ltrch\loch\f3 1.\tab Consider a String containing a well-formed {\b prefix} arithmetic expression that follows the following rules:}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li720\ri0\fi-360{\*\tlswg8236}\tx7020\ltrch\loch\f3\fs24 {\ltrch\loch\f3 *\tab it contains {\b no} blanks;}
\par {\ltrch\loch\f3 *\tab the only possible {\b operands} are 0-9}
\par {\ltrch\loch\f3 *\tab the only possible {\b operations} are +, -, *, /  (all the binary versions --- no unary ones)}
\par {\ltrch\loch\f3 *\tab it follows the rules for a prefix expression --- each operator is indeed followed by two operands, an operand and a prefix expression, a prefix expression and an operand, or two prefix expressions.}
\par 
\par {\ltrch\loch\f3 (that is, verifying that the string {\b is} a "good" prefix expression is not part of this particular assignment...)}
\par 
\par {\ltrch\loch\f3 Create a class {\b ExpressionPlay}; it needs to extend JPFalt, and contain a simple constructor (the following will do):}
\par 
\par {\ltrch\loch\f3 \tab {\fs20\f2 ExpressionPlay() \{\}}}
\par 
\par {\ltrch\loch\f3 \tab This is simply so that we can make use of {\b println() }and the Java Power Tools Text Console in one of the methods we will be creating within this class. }
\par 
\par {\ltrch\loch\f3 Within this class, include a {\b static }method {\b buildExprTree()} that takes a single String as its argument, containing a well-formed prefix arithmetic expression as described above. It returns a Cs132BinaryTree containing the expression tree corresponding to th
at prefix expression. (From lecture: an expression tree has operators in the interior nodes, and operands in its leaves...)}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li720\ri0\fi-360{\*\tlswg8236}\tx7020\ltrch\loch\f3\fs24\b {\ltrch\loch\f3 Hints:}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li1050\ri0\fi-360{\*\tlswg8236}\tx7350\ltrch\loch\f3\fs24 {\ltrch\loch\f3 *\tab {\b IMPORTANT}: copy the string into a Cs132List (any working implementation of it is fine; I used Cs132LinkedList, myself) and use that list as your argument to a recursive auxiliary function to actually do the main work of {\b buildExprTree()}. Trust me on this 
--- it would take too long to go into here, but using the string and an index into that string (as done in the binary search, quicksort, and mergesort implementations that we have studied) does NOT work here, because of how Java really passes arguments.}
\par 
\par {\ltrch\loch\f3 *\tab remember how you call a static method...}
\par 
\par {\ltrch\loch\f3 *\tab (if you want some debugging println()'s while working on buildExprTree(), comment out the {\b static} and then call it as solveTowers() was called in class RecursionExamplesTest.)}
\par 
\par {\ltrch\loch\f3 *\tab it is a prefix expression, hm? You'll want to "walk" through the prefix expression string-turned-into-list, handling each character appropriately.}
\par 
\par {\ltrch\loch\f3 *\tab when you see an {\b operator}, what should you do with it? What do you know must follow it (since we are assuming well-formed prefix expressions)? Where does such an operator go in an expression tree?}
\par 
\par {\ltrch\loch\f3 *\tab when you see an {\b operand}, what should you do with it? Where does such an operand go in an expression tree?}
\par 
\par {\ltrch\loch\f3 *\tab {\b Recursion} should be used in this! }
\par 
\par {\ltrch\loch\f3 *\tab note that {\b setLeft()} and {\b setRight()} can be used to "attach" left and right subtrees to a tree's (or subtree's) root node;}
\par 
\par {\ltrch\loch\f3 *\tab note that, to attach a {\b leaf} (to the left or right of a root), you need to build a little 1-element tree and attach that little Cs132BinaryTree; see the examples in Cs132BinaryTreeTest to see what I mean.}
\par 
\par {\ltrch\loch\f3 *\tab feel free to use "helper" functions as they seem appropriate; if {\b private}, test them within class ExpressionPlay, and if {\b public}, test them within ExpressionPlayTest.}
\par 
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li705\ri0\fi-360{\*\tlswg8236}\tx7005\ltrch\loch\f3\fs24 {\ltrch\loch\f3 You will of course {\b test} buildExprTree() within a class ExpressionPlayTest. Test it on at least the following strings (and at least one additional string of your choice):}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li705\ri0\fi-360{\*\tlswg8236}\tx7005{\ltrch\loch\f3{\b0\i0{\fs24\f3 \tab }{\fs20\f2 "+35"}}}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li705\ri0\fi-360{\*\tlswg8236}\tx7005\ltrch\loch\f2\fs20 {\ltrch\loch\f2 \tab "+*35/63"}
\par {\ltrch\loch\f2 \tab "*3+/625"}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li705\ri0\fi-360{\*\tlswg8236}\tx7005\ltrch\loch\f3\fs24 {\ltrch\loch\f3 Turn in a copy of the text console contents from running the methods within ExpressionPlayTest, also.{\*\bkmkstart DDE_LINK1}{\*\bkmkend DDE_LINK1}}
\par 
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li345\ri0\fi-360{\*\tlswg8236}\tx6645\ltrch\loch\f3\fs24\b {\ltrch\loch\f3 2.\tab {\b0 Also within ExpressionPlay, include a method }manipExpr(){\b0  that takes a single String as its argument, containing a well-formed prefix expression following the same restrictions as in #1. It should not be static --- since it will (directly or indirectly) 
output to the Java Power Tools text console instead of returning a value, it should be handled as }{\b solveTowers() }{\b0 was in RecursionExamples() and RecursionExamplesTest().}}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li345\ri0\fi-360{\*\tlswg8236}\tx6645\ltrch\loch\f3\fs24 
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li720\ri0\fi-360{\*\tlswg8236}\tx7020\ltrch\loch\f3\fs24 {\ltrch\loch\f3 Within manipExpr(), call {\b buildExprTree()} to create an expression tree for this well-formed prefix expression, and then traverse your expression tree appropriately {\b three} times, to write the expression to the Java Power Tools text console in infix form {\b with 
appropriate parentheses}, then in prefix form (no fair reading the original input string! You {\b must} generate this using the appropriate tree traversal!), then in postfix form.}
\par 
\par {\ltrch\loch\f3 \tab In your text console output, separate all of the operands and operators by 1 blank, for better readability, and precede each with a label noting which form of notation is to follow. I do not mind if you have blanks before and/or after the parentheses in t
he output for this infix expression, however, nor if such blanks are inconsistent.}
\par 
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li705\ri0\fi-360{\*\tlswg8236}\tx7005\ltrch\loch\f3\fs24 {\ltrch\loch\f3 You will of course {\b test} manipTree() within class ExpressionPlayTest. Test it on at least the following strings (and at least one additional string of your choice):}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li705\ri0\fi-360{\*\tlswg8236}\tx7005{\ltrch\loch\f3{\b0\i0{\fs24\f3 \tab }{\fs20\f2 "+35"}}}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li705\ri0\fi-360{\*\tlswg8236}\tx7005\ltrch\loch\f2\fs20 {\ltrch\loch\f2 \tab "+*35/63"}
\par {\ltrch\loch\f2 \tab "*3+/625"}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li705\ri0\fi-360{\*\tlswg8236}\tx7005\ltrch\loch\f3\fs24 {\ltrch\loch\f3 Turn in a copy of the text console contents from running the method(s) related to manipTree() (and manipTreeTest(), too!) within ExpressionPlayTest, also.}
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li720\ri0\fi-360{\*\tlswg8236}\tx7020\ltrch\loch\f3\fs24 
\par 
\par 
\par \pard\plain \s1\cf1{\*\hyphen2\hyphlead2\hyphtrail2\hyphmax0}\aspalpha\rtlch\af6\afs24\lang255\ltrch\dbch\af5\afs24\langfe255\loch\f3\fs20\lang1033\li360\ri0\fi-360\ltrch\loch\f3\fs20
\par }