[C++] 백준 9934 (levelorder 풀이)

문제 소스 코드 #include #include #include using namespace std; typedef struct tree { int data; tree* LLINK; tree* RLINK; }; int *arr; tree* BinTree; void levelorder_print(tree* BT) { if(BT == NULL) return; queue q; tree* tmp; int space_cnt = 0; int level = 1; q.push(BT); while(1) { tmp = q.front(); if(tmp == NULL) return; printf("%d",tmp->data); if(space_cnt == 0) { printf("\n"); space_cnt = pow(2,level) - 1; } else { printf(" "); space_cnt -= 1; } q.pop(); if(tmp->LL...