用数组存储完全二叉树,例如A【1~n】,如何非递归层次遍历该二叉树,同时...答:int main(int argc, char *argv[]){ int a[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};int n = 20;int i = 0, l = 1, t = 1;while (i < n) { while (i < n && i < t) { printf("%d,%d\n", a[i], l);i++;} t += 1 <...