#define YES 10
#define NO 20
using namespace std;
#include <iostream>
struct Node
{
Node ** children;
int childCount;
char name[1];
int empty;//YES or NO
int sequence;
double value;
};
using namespace std;
bool isEmpty(Node ** ptr, int bsize) {
for (int i = 0; i<bsize; i++) {
for (int j = 0; j < bsize; j++) {
if(ptr[i][j].empty == YES){
return true;
}
}
}
return false;
}
int main (int argc, const char * argv[])
{
int size = 4;
Node ** tree = new Node * [size];
for (int i = 0; i < size; ++i) tree[i] = new Node[size];
// some stuff
if (isEmpty(tree, size)) {
cout<<"this is empty\n";
return 0;
}
return 0;
}
I2RlZmluZSBZRVMgMTAKI2RlZmluZSBOTyAyMAp1c2luZyBuYW1lc3BhY2Ugc3RkOwojaW5jbHVkZSA8aW9zdHJlYW0+CgpzdHJ1Y3QgTm9kZQp7CiAgICBOb2RlICoqIGNoaWxkcmVuOwogICAgaW50ICAgICBjaGlsZENvdW50OwogICAgY2hhciBuYW1lWzFdOwogICAgaW50IGVtcHR5Oy8vWUVTIG9yIE5PCiAgICBpbnQgc2VxdWVuY2U7CiAgICBkb3VibGUgIHZhbHVlOwp9OwoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmJvb2wgaXNFbXB0eShOb2RlICoqIHB0ciwgaW50IGJzaXplKSB7ICAgIAogICAgZm9yIChpbnQgaSA9IDA7IGk8YnNpemU7IGkrKykgewogICAgICAgIGZvciAoaW50IGogPSAwOyBqIDwgYnNpemU7IGorKykgewogICAgICAgICAgICBpZihwdHJbaV1bal0uZW1wdHkgPT0gWUVTKXsKICAgICAgICAgICAgICAgIHJldHVybiB0cnVlOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIGZhbHNlOwp9CgppbnQgbWFpbiAoaW50IGFyZ2MsIGNvbnN0IGNoYXIgKiBhcmd2W10pCnsKICAgIGludCBzaXplID0gNDsKICAgIE5vZGUgKiogdHJlZSA9IG5ldyBOb2RlICogW3NpemVdOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBzaXplOyArK2kpIHRyZWVbaV0gPSBuZXcgTm9kZVtzaXplXTsKLy8gc29tZSBzdHVmZgogICAgaWYgKGlzRW1wdHkodHJlZSwgc2l6ZSkpIHsKICAgICAgICBjb3V0PDwidGhpcyBpcyBlbXB0eVxuIjsKICAgICAgICByZXR1cm4gMDsKICAgIH0KICAgIHJldHVybiAwOwp9