eleLetters[k])k=j;}if( (1)){c=p一>eleLet七ers;p一>eleLetters =p一>eleLetters[k];p一>eleLetters[k]=c;}//if}//for};int find(N0de&root, char*temp)//在二叉排序树root中查找与temp匹配的单词。//若匹配返回相应单词在wordList中下标;若查找失败,返回一1 Node*p, *q;int flag;p=(2);//临时存储 recompose(p, temp);//将temp重组 q=&root; while((flag= (3) ) &&q !=NULL){ if(flag<0)(//搜索左子树 q=q一>lChild; )else(//搜索右子树 q=q一>rChild; } }//while if(flag==0)(//找到匹配的,保存下标 return (4); } if((5))(//查找失败 printf(”cant unscramble the following word : %s”, temp);; return一1: } }: