struct Node* restore_tree(struct Node *node, T_bit_file *bf, struct T_smart_byte *byte){
    int bit = f_get_bit(bf);
    printf("%d", bit);
    if(bit){
        for (int i = 0; i < 8; ++i) {
            set_bit(byte, f_get_bit(bf), NULL);
        }
        struct Node* new_leaf = create_queue_item((char)byte->data, 0, NULL, NULL);
        node->left = new_leaf;
        if(node->right == NULL){
            node->right = restore_tree(node->right, bf, byte);
        }
        return NULL;
    }

    struct Node* new_node = create_queue_item(EOF, 0, NULL, NULL);
    new_node->left = restore_tree(new_node, bf, byte);
    new_node->right = restore_tree(new_node, bf, byte);
    return new_node;
}