1.2008.02.28 方正国际 C++ structNode...{intvalue;Node*pLeft;Node*pRight;};voidAppendValue(Node*pRoot,intvalue)...{if(pRoot)...{if(pRoot->value>value)...{if(pRoot->pLeft)...{AppendValue(pRoot->pLeft,value);}else...{Node*node=newNode();node->value=value;node->pLeft=node->pRight=NULL;pRoot->pLeft=node;}}else...{if(pRoot->pRight)...{AppendValue(pRoot->pRight,value);}else...{Node*node=newNode();node->value=value;node->pLeft=node->pRight=NULL;pRoot->pRight=node;}}}}voidMidTree(Node*pRoot)...{if(pRoot)...{MidTree(pRoot->pLeft);std::cout<<pRoot->value<<"";MidTree(pRoot->pRight);}}/**//***创建排序2叉树*/Node*CreateSortBinaryTree(int*values,intcount)...{assert(count>0);Node*pRoot=newNode();pRoot->pLeft=pRoot->pRight=NULL;pRoot->value=values[0];for(intindex=1;index<count;index++)...{AppendValue(pRoot,values[index]);}returnpRoot;}intChCmp(charlCh,charrCh)...{if(lCh>='A'&&lCh<='Z')...{lCh=lCh-'A'+'a';}if(rCh>='A'&&rCh<='Z')...{rCh=rCh-'A'+'a';}if(lCh>rCh)...{return1;}elseif(lCh<rCh)...{return-1;}return0;}/**//***比较字符串,忽略大小写*/intStrCmp(constchar*lStr,constchar*rStr)...{intres=0;while(*lStr!='