struct HTnode
{
    HTnode *next, *right, *left;
    char sign;
    int counter;
};

void Sort(HTnode *&first)
{

}

void MakeList(HTnode *&root, string s)
{
    root = NULL;
    HTnode *pom;
    for(int i=0; i<s.length(); i++){
        pom = root;
        while(pom && pom->sign != s[i])
            pom = pom->next;
        if(pom->sign == s[i])
            pom->counter++;
        else{
            pom = new HTnode;
            pom->next = root;
            pom->left = pom->right = NULL;
            pom->sign = s[i];
            pom->counter = 1;
        }
    }
    Sort(root);
}

void Insert(HTnode *&root, HTnode *nowy)
{

}

void createHT(HTnode *&root)
{
    HTnode *p=root->next;
    HTnode *pom;
    HTnode *v1, *v2;
    while(root && root->next){
        v1 = root;
        v2 = root->next;
        root = v2->next;
        pom = new HTnode;
        pom->counter = v1->counter + v2->next->counter;
        pom->left = v1;
        pom->right = v2;
        Insert(root, pom);
    }
}