Solution for Problem 1
a.
(from left to right)
Level 1:          23
Level 2:    23          21
Level 3: 23    99    98    21
Level 4: the same as the original values.

b.
Please refer to the implementation of the ADT Binary Tree from Page 455 to Page
463, but do some little modification:
(1) Add a field, indicating the type of a node(Min or Max), to struct treeNode.
    Then do the corresponding modification to the fuctions.
    (For example, I add a field defined as: int ItemType; )
(2) Evaluate the Minimax tree based on the postorder traversal algorithm. Add
    two functions as below to evaluate the tree:

void binTreeClass::Evaluate(ptrType TreePtr)
{
//if the node is Min node
	if(TreePtr->ItemType==1) {
		if((TreePtr->LChild!=NULL)
			TreePtr->Item=(TreePtr->Item <= TreePtr->LChild->Item)? TreePtr->Item : TreePtr->LChild->Item;
		if((TreePtr->Rchild!=NULL)
			TreePtr->Item=(TreePtr->Item <= TreePtr->RChild->Item)? TreePtr->Item : TreePtr->LChild->Item;
	}
	
//if the node is Max node
	if(TreePtr->ItemType==2) {
		if((TreePtr->LChild!=NULL)
			TreePtr->Item=(TreePtr->Item >= TreePtr->LChild->Item)? TreePtr->Item : TreePtr->LChild->Item;
		if((TreePtr->Rchild!=NULL)
			TreePtr->Item=(TreePtr->Item >= TreePtr->RChild->Item)? TreePtr->Item : TreePtr->LChild->Item;
	}			
}

void binTreeClass::PostSearch(ptrType TreePtr)
{
	if (TreePtr!=NULL){
		PostSearch(TreePtr->LChildPtr);
		PostSearch(TreePtr->RChildPtr);
		Evaluate(TreePtr);
	}
}


===============================================================================

Solution for Problem 2
Fig.10-42:
    Preorder: MGDAHKLTRVUW
    Inorder:  ADHGKLMRUVTW
    Postorder:AHDLKGUVRWTM

Fig.10-44:
    Preorder: 0 100 0 1 23 0 17 99 100 0 98 53 0 21 0
    Inorder:  1 0 23 100 17 0 99 0 98 0 53 100 21 0 0
    Postorder:1 23 0 17 99 0 100 98 53 0 21 0 0 100 0
    
===============================================================================

Solution for Problem 3

The maximum number of nodes is: (K^H-1)/(K-1)

===============================================================================

Solution for Problem 4

a. Node 6. In an inorder traversal, the successor of node A is the left-most
node in the subtree of node A, if any.

b. 425816937

===============================================================================

Solution for Problem 5

a.                            W
                             /
		            T
			   /
                          N
	                 /
		        J
		       /
	              E
		     /
		    B
		   /
	          A
		  
b.                W
                 /
		T
	       /
	      N
	     /
	    A
	     \
	      B
	       \
	        E
		 \
		  J
		  
c.           A
              \
	       B
	        \
		 W
		/
	       J
	      / \
	     E   N
	          \
		   T