FDAFHUSGA

adigqfspijpiJfwouFHLVH'wHAhvohwAEVUAEvuEQBVUA'
DCVulegfuc'EAFUHuEA{'bvUABURWV'ivh'orvuIVOEVB'

int pruneSize(int tolerance) const{
    if(root != NULL)
        return pruneSize(tolerance, root);

    return 0;
}

int pruneSize(int tolerance, QuadtreeNode * const & curr) const{
    if(curr == NULL){
        return 0;
    }

    if(pruneSize(tolerance,curr,curr)){
        return 1;
    }

    else
        return pruneSize(tolerance,curr->nwChild) + pruneSize(tolerance,curr->neChild) + pruneSize(tolerance,curr->swChild)+ pruneSize(tolerance,curr->seChild);
}

bool pruneSize(int tolerance,QuadtreeNode * const & q1, QuadtreeNode * const & q2) const{
    if(q2->nwChild==NULL && q2->neChild==NULL && q2->swChild==NULL && q2->seChild==NULL)
        return (checkPrune(tolerance,q1,q2));

    return pruneSize(tolerance,q1,q2->nwChild)&&pruneSize(tolerance,q1,q2->neChild)&&pruneSize(tolerance,q1,q2->seChild)&&pruneSize(tolerance,q1,q2->swChild);
}

bool checkPrune(int tolerance, QuadtreeNode* const& q1, QuadtreeNode* const& q2) const{
    return (((q1->element.red  - q2->element.red)*(q1->element.red  - q2->element.red) + (q1->element.green - q2->element.green)*(q1->element.green - q2->element.green) + (q1->element.blue - q2->element.blue)*(q1->element.blue - q2->element.blue)) <= tolerance);
}