void addNode(Node*p)
{
      if(root == NULL)
      {
            root = p;
            return;
      }
      Node*q = root;
      int cmp;
      while(1)
      {
            if(q == NULL)
            {
                  q = p;
                  q->leftChild = p->leftChild;
                  q->rightChild = p->rightChild;
                  q->parent = p->parent;
                  return;
            }
            cmp = strcmp(q->Name,p->Name);
            switch(cmp)
            {
                  case 0:
                  return;
                  case -1:
                  q = q->rightChild;
                  break;
                  case 1:
                  q = q->leftChild;
                  break;
            }
      }
}