void function()
{ xxxxxxx;
if ()
{ xxxxxxxx;
xxxxxxxx; }}
void Insert(CNode * pRoot, char * s)
{ for( int i = 0; s[i]; i ++ )
{ if( pRoot->pChilds[s[i]-'a'] == NULL)
{ pRoot->pChilds[s[i]-'a'] = Tree + nNodesCount;
nNodesCount ++; }
pRoot = pRoot->pChilds[s[i]-'a']; }
pRoot-> bBadNode = true; }