c语言代码解决问题

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

#define maxsize 1001

typedef struct treenode

{

int data[maxsize];

int n;

}Tree;

int depthtree(Tree root)

{

int depth=1,sum=1,mult=2;

while (sum < root.n)

{

sum += mult;

mult *= 2;

depth++;

}

return depth-1;

}

int location(int depth)

{

int sum = 0, mult = 1,i;

for (i = 1; i < depth; i++)

{

sum += mult;

mult *= 2;

}

return sum;

}

int main()

{

int n, d, depth,i;

Tree root;

while (scanf_s("%d", &n) == 1 && n != 0)

{

root.n = n;

for (i = 0; i < n; i++)

{

scanf_s("%d", &root.data[i]);

}

depth = depthtree(root);

scanf_s("%d", &d);

if (depth < d)

printf("EMPTY\n");

else

{

for (i =location(d) ;i < location(d+1); i++)

{

printf("%d ", root.data[i]);

}

printf("\n");

}

}

return 0;

}